操作系统教学课件：Chapter 8 Deadlocks.pptVIP

Detection-Algorithm Usage When, and how often, to invoke depends on: How often a deadlock is likely to occur? How many processes will need to be rolled back? one for each disjoint cycle If detection algorithm is invoked arbitrarily, there may be many cycles in the resource graph and so we would not be able to tell which of the many deadlocked processes “caused” the deadlock. Recovery from Deadlock: Process Termination Abort all deadlocked processes. Abort one process at a time until the deadlock cycle is eliminated. In which order should we choose to abort? Priority of the process. How long process has computed, and how much longer to completion. Resources the process has used. Resources process needs to complete. How many processes will need to be terminated. Is process interactive or batch? Recovery from Deadlock: Resource Preemption Selecting a victim – minimize cost. Rollback – return to some safe state, restart process for that state. Starvation – same process may always be picked as victim, include number of rollback in cost factor. Combined Approach to Deadlock Handling Combine the three basic approaches prevention avoidance detection allowing the use of the optimal approach for each of resources in the system. Partition resources into hierarchically ordered classes. Use most appropriate technique for handling deadlocks within each class. Summary 死锁：一组进程是死锁的，该组中的每一个进程正在等待这组中其他进程占有的资源时可能引起的一种错误现象。 死锁产生的原因 根本原因，系统资源不足 进程推进顺序不当 死锁产生的必要条件 互斥，占有和等待，不可剥夺，循环等待 死锁处理策略 忽略不计 预防，设法破坏四个必要条件 避免 为进程分配资源时，每当完成分配后，立即检查系统是否处于安全状态，若是，分配成功，否则，分配作废，让其阻塞等待 资源分配图算法、银行家算法 需要进程对资源需求的先验知识 设法找到一种安全的进程执行序列 检测与恢复 采用资源动态分配算法，当进程请求分配资源时，只要系统有可用资源就满足，系统定期启动死锁检测算法，检查是否有环（进程等待图） 作业 1. Consider the traffic deadlock depicted in following Figure. a. Show that the four necessary conditions for deadlock indeed hold in this example. b. State a simple rule that will avoid deadlocks in this system. 2. In a real computer system, neither the resources available nor the demands of p