①request1<need1并且request1<availabel
所以资源试分配
availabel = available - request1 = (1,1,1)
allocation1 = allocation1 + request1 = (3,3,3)
need1 = need1 - request1 = (2,3,4)
②进行安全性检测
work = available = (1,1,1)
finish[0-4] = false
因为need1 < work 并且 finish[1] = false; 所以 finish[1] = true,work = work + allocation1 = (1,3,3)
......
至此，finish[0-4] = true,找到安全序列<p0,p1,p4,p3,p5>，系统处于安全状态。
故请求能立刻被满足
收藏
