[理工] [OS] - deadlock free
Consider a computer system consisting of 4 resources of the type A
and 4 resources of the type B that are shared by 3 processes.
Type A and type B resources are boundled in the sense that
a process always gets an A if it gets a B, and vice versa.
Each of these processes requires no more than 2 resources of type A
and 2 resources of type B.
Is this system deadlock-free?
Show proof for your answer.
這類題目我都是用鴿籠原理去想
如果是問答題好像比較難下筆
解答寫說:
ΣMax[i] = 6
ΣMax[i] = ΣNeed[i] + ΣAllocation < 4 + 3
想問最後的不等式怎麼得到?
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.230.126.34
推
08/21 15:48, , 1F
08/21 15:48, 1F
→
08/21 15:48, , 2F
08/21 15:48, 2F
→
08/21 15:49, , 3F
08/21 15:49, 3F
→
08/21 15:50, , 4F
08/21 15:50, 4F
→
08/21 16:02, , 5F
08/21 16:02, 5F
→
08/21 16:04, , 6F
08/21 16:04, 6F
→
08/21 16:04, , 7F
08/21 16:04, 7F
推
08/21 17:24, , 8F
08/21 17:24, 8F