Term
| What does circular wait mean? Given a set of proceses, P0, P1, … Pn |
|
Definition
|
P0 is waiting for a resource from P1, P1 is waiting for Pn, and Pn is waiting for P0
|
|
|
Term
| Which Deadlock avoidance algorithms can be used to dynamically examine the resource allocations to ensure a circular wait condition does not exist? |
|
Definition
|
safe state and resource allocation graph
|
|
|
Term
| If deadlock prevention and deadlock avoidance are not employed, what other approach can be used? |
|
Definition
|
Deadlock detection
An algorithm that examines the state of the system to determine whether a deadlock has occurred
An algorithm to recover from the deadlock
|
|
|
Term
| If there are several instances of a resource type in the system and you are checking for a deadlock, what other structures do you need? |
|
Definition
|
A vector of available resources
A matrix that defines the number of resources of each type currently allocated to each process
A matrix that indicates the current request of each process.
|
|
|
Term
| What option is a way to recover from a deadlock? |
|
Definition
Process termination
Resource preemption
|
|
|
