os操作系统死锁deadlock.pptVIP

Banker’s Algorithm We must determine whether his new system state is safe - we execute the safety algorithm again and find that the following sequence is safe: P1 P3 P4 P0 P2 We can then immediately grant the request of process P1 Deadlock Detection and Recovery Deadlock Detection Not necessary if deadlock avoidance or deadlock prevention technique is used When a deadlock occurs, the operating system must provide An algorithm that examines the state of the system (to verify the deadlock) An algorithm to recover from the deadlock Deadlock Detection If all resources have only a single instance we can use a wait-for graph (a variant of the resource allocation graph) system must maintain the graph and periodically search for a cycle in the graph For multiple resource instances - see an approach in the main text which is similar to Banker’s Algorithm P1 ? P2 P3 ? ? R1 R3 R2 Resource Allocation Graph Wait-For Graph P1 P2 P3 Deadlock Detection Usage When should we use a detection algorithm – the answer depends on How often is a deadlock likely to occur How many processes will be affected by deadlock when it happens Deadlock Detection Invoking a deadlock detection algorithm frequently may incur a considerable overhead in computation time A less expensive alternative is simply invoke the algorithm when, for example, the CPU utilisation drops below 40% Deadlock Recovery Who deals with deadlock? operator, system administrator How? process termination resource pre-emption Deadlock Recovery Process termination Abort all deadlocked processes (expensive) Abort one process at a time until the deadlock cycle is eliminated (considerable overhead since after each process is aborted a detection algorithm must be invoked to determine if any processes are still deadlocked) If a process in in the midst of updating a file, terminating it will leave the file in an incorrect state Deadlock Recovery Many factors may determine which process is chosen (for termination) priority how