第7讲.死锁与银行家算法解释.ppt

* * * * * * * * * * * * * * * * * Available :＝Available－Request1 ＝(3, 3, 2)－(1, 0, 2)＝(2, 3, 0) Allocation1 :＝Allocation1＋Request1 ＝(2, 0, 0)＋(1, 0, 2)＝(3, 0, 2) Need1 :＝Need1－Request1 ＝(1, 2, 2)－(1, 0, 2)＝(0, 2, 0) 银行家算法实例 Chapter 3 处理机调度与死锁 Finish Available Allocation Need Work true 5 3 2 3 0 2 0 2 0 2 3 0 P1 P4 P3 P2 P1 P0 Available A, B, C Need A, B, C Allocation A, B, C Max A, B, C 进 程 资源 情况 7, 5, 3 3, 2, 2 9, 0, 2 2, 2, 2 4, 3, 3