Chap 7 Deadlock Conditions Flashcards

1
Q

Hold and wait

A

A process may hold a resource at the same time it requests another one.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Mutual exclusion (exclusive use)

A

Once a process has been allocated a particular resource, the threads in the process have exclusive use of the resource. No other processes can use a resource while it is allocated to a process.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Circular wait

A

 A situation can rise in which process p1 holds resource R1 while one of its threads requests resource R2, and process p2 holds R2 while one of its threads requests resource R1. There may be more than two processes involved in the circular wait.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

No preemption

A

 Resources can be released only by the explicit action in a process, rather than by the action of an external authority. This assumption includes the case in which a process places a request for a resource and the resource is not available. Then the process cannot withdraw its request.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Addressing Deadlock - Prevention

A

Design the system so that
deadlock is impossible

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Addressing Deadlock - Avoidance

A

Construct a model of system
states, then choose a strategy that will not allow the system to go to a deadlock state

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Addressing Deadlock - Detection & Recovery

A

Check for deadlock (periodically or sporadically), then recover

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Addressing Deadlock - Manual intervention

A

Have the operator reboot the machine if it seems too slow

How well did you know this?
1
Not at all
2
3
4
5
Perfectly