DeadlocksPartIIDetectionandRecovery.pptVIP

Deadlocks: Part IIDetection and Recovery;Dining Philophers Problem;Four requirements for Deadlock;We saw that you can prevent deadlocks. By negating one of the four necessary conditions. (which are..?) We saw that the OS can schedule processes in a careful way so as to avoid deadlocks. Using a resource allocation graph. Banker’s algorithm. What are the downsides to these?;Techniques for Preventing Deadlock;Techniques for Preventing Deadlock (con’t);Toward right idea: State maximum resource needs in advance Allow particular thread to proceed if: (available resources - #requested) ? max re