作業系統›Ch5 Deadlock(死結)
第 6 題/共 11 題
◀ OS 6/11
6. Deadlock、Safe State、Resource Allocation
#OS-05-006難DeadlockSafe StateResource Allocation

Consider a system with mm resources and 4 threads: T0T_0, T1T_1, T2T_2, and T3T_3. Let xix_i and yiy_i denote the maximum number of resources requested and the current number of resources held by thread TiT_i, respectively, for all ii, 0≤i≤30 \le i \le 3. Which of the following statement(s) are correct?

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