[理工] [OS]-97 交大
Consider a system with five processes P0 through P4
and three resource types A,B,C.
Resource type A has 11 instances, resource type B has 5 instances,
and resource type C has 7 instances.
Suppose at time T0,the following snapshot of the system has been taken
____________________________________
Allocation Max
A B C A B C
____________________________________
P0 0 1 0 7 5 3
P1 2 0 0 3 2 2
P2 3 0 2 9 0 2
P3 2 1 1 2 2 2
P4 0 0 2 4 3 3
____________________________________
Please calcucate the maximum request
(consider type A fiest,then B,and C last,and all together)
which can be granted for process P0,P1,P2,P3,and P4 ,respectively,
for the system to be in safe states
這題引用之前有人問過
可是好像沒有說明 HOW
因為碰到這題 有點不知道該如何下筆
請問一下這題要如何解？？
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 61.230.223.184
→
03/09 18:07, , 1F
03/09 18:07, 1F
→
03/09 18:08, , 2F
03/09 18:08, 2F
→
03/09 18:10, , 3F
03/09 18:10, 3F
→
03/09 18:11, , 4F
03/09 18:11, 4F
→
03/09 18:14, , 5F
03/09 18:14, 5F
→
03/09 18:15, , 6F
03/09 18:15, 6F
→
03/09 18:23, , 7F
03/09 18:23, 7F