Deadlock Prevention, Avoidance, and Detection防止死锁避免和检测.pptVIP

Deadlock Prevention, Avoidance, and Detection The Deadlock problem In a computer system deadlocks arise when members of a group of processes which hold resources are blocked indefinitely from access to resources held by other processes within the group. Deadlock example Pi requests one I/O controller and the system allocates one. Pj requests one I/O controller and again the system allocates one. Pi wants another I/O controller but has to wait since the system ran out of I/O controllers. Pj wants another I/O controller and waits. Conditions for deadlocks Mutual exclusion. No resource can be shared by more than one process at a time. Hold and wait. There must exist a process that is holding at least one resource and is waiting to acquire additional resources that are currently being held by other processes. No preemption. A resource cannot be preempted. Circular wait. There is a cycle in the wait-for graph. An example Graph-theoretic models Wait-for graph. Resource-allocation graph. Wait-for graph Resource allocation graph Wait-for graph and Resource-allocation graph conversion Any resource allocation graph with a single copy of resources can be transferred to a wait-for graph. Strategies for handling deadlocks Deadlock prevention. Prevents deadlocks by restraining requests made to ensure that at least one of the four deadlock conditions cannot occur. Deadlock avoidance. Dynamically grants a resource to a process if the resulting state is safe. A state is safe if there is at least one execution sequence that allows all processes to run to completion. Deadlock detection and recovery. Allows deadlocks to form; then finds and breaks them. Two types of deadlocks Resource deadlock: uses AND condition. AND condition: a process that requires resources for execution can proceed when it has acquired all those resources. Communication deadlock: uses OR condition. OR condition: a process that requires resources for execution can proceed when it has acquir