※ 引述《mqazz1 (無法顯示)》之銘言：
: consider a system consisting of 4 resources of the same type
: that are shared by 3 process
: each of which needs at most 2 resources
: show that the system is deadlock-free
: 請問這個要怎麼證呢?
: 為什麼呢?
: 謝謝
m=4,n=3,Maxi=2(表示第i個process所需最大resource量)
要形成deadlock free需滿足1<=Maxi<=m且sigma(Maxi)<n+m
因為1<=2<=4且sigma(Maxi)=6<7=3+4 所以次系統deadlock free
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.39.4.138