(操作系统教学课件）ch7Deadlocks.ppt

* * * * * * * * * * * * Work 代表可用资源 Finish 代表此进程是否已完成。 第二步是找到 * * * * * * * * * * * * * * Minimum cost * * Example of Banker’s Algorithm 5 processes P0 through P4; 3 resource types: A (10 instances), B (5instances), and C (7 instances) Snapshot at time T0: Allocation Max Available A B C A B C A B C P0 0 1 0 7 5 3 3 3 2 P1 2 0 0 3 2 2 P2 3 0 2 9 0 2 P3 2 1 1 2 2 2 P4 0 0 2 4 3 3 Example (Cont.) The content of the matrix Need is defined to be Max – Allocation Need A B C P0 7 4 3