文件名称:yinghangjiaWenDan
介绍说明--下载内容均来自于网络,请自行研究使用
设Request[i] 是进程Pi的请求向量,如果Request[i,j]=K,表示进程Pi需要K个Rj类型的资源。当Pi发出资源请求后,系统按下述步骤进行检查:
如果Request[i,j]<= Need[i,j],便转向步骤2;否则认为出错,因为它所需要的资源数已超过它所宣布的最大值。
如果Request[i,j]<= Available[j],便转向步骤3;否则表示尚无足够资源,Pi须等待。
系统试探着把资源分配给进程Pi,并修改下面数据结构中的数值:
Available[j]:= Available[j]- Request[i,j]
Allocation[i,j]:=Allocation[i,j]+Request[i,j];
Need[i,j]:= Need[i,j]- Request[i,j];
-based Request [i] is the process at the request of Vector Pi, if Request [i, j] = K, said the process needs Pi K-NY types of resources. When Pi issued resources request, the system according to the following steps to check : If the Request [i, j]
如果Request[i,j]<= Need[i,j],便转向步骤2;否则认为出错,因为它所需要的资源数已超过它所宣布的最大值。
如果Request[i,j]<= Available[j],便转向步骤3;否则表示尚无足够资源,Pi须等待。
系统试探着把资源分配给进程Pi,并修改下面数据结构中的数值:
Available[j]:= Available[j]- Request[i,j]
Allocation[i,j]:=Allocation[i,j]+Request[i,j];
Need[i,j]:= Need[i,j]- Request[i,j];
-based Request [i] is the process at the request of Vector Pi, if Request [i, j] = K, said the process needs Pi K-NY types of resources. When Pi issued resources request, the system according to the following steps to check : If the Request [i, j]
(系统自动生成,下载前可以参看下载内容)
下载文件列表
压缩包 : 81404563yinghangjiawendan.rar 列表 文档在线[www_WenDang_com].doc