[理工] [OS] Deadlock
Consider a system consisting of M resource of the same type
that are shared by K process,each of whick needs at most N resources.
What is the maximum value of K that keeps the system deadlock free?
以下是我寫的
若系統為deadlock free 則 1 <= N <= M 必成立
i=1~K 西格碼 Maxi < K+M
N‧K < K+M
K < K+M/N
請問這樣寫對嗎？
可以這樣寫嗎？
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 114.39.62.118
→
03/18 21:29, , 1F
03/18 21:29, 1F
→
03/18 22:12, , 2F
03/18 22:12, 2F
→
03/18 22:34, , 3F
03/18 22:34, 3F
→
03/19 00:17, , 4F
03/19 00:17, 4F
→
03/19 01:32, , 5F
03/19 01:32, 5F