《OPERATING SYSTEMS教学课件》ch6.pptVIP

* Recovery from Deadlock Recovery through killing processes crudest but simplest way to break a deadlock kill one of the processes in the deadlock cycle, then the other processes get its resources kill process that can be rerun from the beginning with no ill effects * (3) Deadlock Avoidance The deadlock-avoidance algorithm dynamically examines the resource-allocation state to ensure that there can never be a circular-wait condition. Requires that the system has some additional a priori information available. Simplest and most useful model requires that each process declare the maximum numbe