作業系統›Ch5 Deadlock(死結)
第 7 題/共 11 題
◀ OS 7/11
7. Banker's Algorithm、Safe State
#OS-05-007中Banker's AlgorithmSafe State

Consider a system with 15 resources and 4 threads: T0,T1,T2T_0, T_1, T_2, and T3T_3. The second column in the following table shows the maximum number of resources need by each thread and the third column shows the number of resources each thread is currently holding. Let x^\hat{x} be the maximum value of xx (shown below) that can still keep the system in a safe state. Which statements are correct?

Maximum NeedsCurrent Needs
T0T_053
T1T_141
T2T_295
T3T_3xx4
📄 交大111
跳轉到第題
▤完整推導請見《WH 資工筆記 · 作業系統》Ch5 Deadlock(死結)
本章題號 · 1–11 / 11