Chapter7:DeadlocksChapter7:DeadlocksChapterObjectivesTheDeadlockProblemBridgeCrossingExampleSystemModelDeadlockCharacterizationResource-AllocationGraphResource-AllocationGraph(Cont.)ExampleofaResourceAllocationGraphResourceAllocationGraphWithADeadlockGraphWithACycleButNoDeadlockBasicFactsMethodsforHandlingDeadlocksDeadlockPreventionDeadlockPrevention(Cont.)DeadlockAvoidanceSafeStateBasicFactsSafe,Unsafe,DeadlockStateAvoidancealgorithmsResource-AllocationGraphSchemeResource-AllocationGraphUnsafeStateInResource-AllocationGraphResource-AllocationGraphAlgorithmBanker’sAlgorithmDataStructuresfortheBanker’sAlgorithmSafetyAlgorithmResource-RequestAlgorithmforProcessPiExampleofBanker’sAlgorithmExample(Cont.)Example:P1Request(1,0,2)DeadlockDetectionSingleInstanceofEachResourceTypeResource-AllocationGraphandWait-forGraphSeveralInstancesofaResourceTypeDetectionAlgorithmDetectionAlgorithm(Cont.)ExampleofDetectionAlgorithmExample(Cont.)Detection-AlgorithmUsageRecoveryfromDeadlock:ProcessTerminationRecoveryfromDeadlock:ResourcePreemptionEndofChapter7