操作系统原理：第八章 死锁.pptVIP

Deadlock 资源是有限的，对资源的需求可能是无限的 当占有了部分资源而渴求更多的资源的时候，可能会引起deadlock（死锁） OS管理着、分配着计算机系统的资源，必须考虑死锁 Bridge Crossing Example Traffic only in one direction. Each section of a bridge can be viewed as a resource. If a deadlock occurs, it can be resolved if one car backs up (preempt resources and rollback). Several cars may have to be backed up if a deadlock occurs. Starvation is possible. System Model Resource types R1, R2, . . ., Rm CPU cycles, memory space, I/O devices Each resource type Ri has Wi instances. cpu，一个 存储，一个硬盘（多个分区）、U盘、光盘…… 打印机，一个 …… Each process utilizes a resource as follows: request use release 何时发生死锁? 如何处理死锁? 避免 死锁发生. 检测 死锁并解决（从死锁中恢复） 如何做死锁避免和检测? Resource-Allocation Graph V is partitioned into two types: P = {P1, P2, …, Pn}, the set consisting of all the processes in the system. R = {R1, R2, …, Rm}, the set consisting of all resource types in the system. request edge – directed edge P1 ? Rj assignment edge – directed edge Rj ? Pi Resource-Allocation Graph (Cont.) Process Resource Type with 4 instances Pi requests instance of Rj Pi is holding an instance of Rj Example of a Resource Allocation Graph Resource Allocation Graph With A Deadlock Resource Allocation Graph With A Cycle But No Deadlock Basic Facts If graph contains no cycles ? no deadlock. If graph contains a cycle ? if only one instance per resource type, then deadlock. if several instances per resource type, possibility of deadlock. Methods for Handling Deadlocks Ensure that the system will never enter a deadlock state. To prevent or avoid Allow the system to enter a deadlock state and then recover. Ignore the problem and pretend that deadlocks never occur in the system; used by most operating systems, including UNIX. Deadlock Prevention Mutual Exclusion – not required for sharable resources; must hold for nonsharable resources. Hold and Wait – must guarantee that whenever a process requests a resource, it does not hold any other resources. Require process to request and be allocate