搜索资源列表
-
0下载:
本程序主要对操作系统中的死锁预防部分的理论进行实验。设计一个程序,该程序可对每一次资源申请采用银行家算法进行分配。
1) 设计多个资源:10;
2) 设计多个进程:8 ;
3) 设计银行家算法相关的数据结构;
4) 动态进行资源申请、分配、安全性检测并给出分配结果
-This procedure focused on the prevention of deadlock in the operating system part of the theory of the exp
-
-
0下载:
计算机算法中用到的经典算法。包括01背包,多段图,资源分配问题,子数合集等。-Computer algorithms used in the classical algorithm. Including 01 backpack, multi map, resource allocation, the number of sub-collection, etc..
-
-
0下载:
实现了银行家算法,功能有:添加资源、删除资源、修改资源、分配资源、修改作业-Realized the bankers algorithm functions are: add resources, remove the resource, modify resources, the allocation of resources, modify operations ......
-
-
0下载:
为了避免死锁产生和避免的情况,用银行家算法实现系统资源分配。-In order to avoid deadlock and avoid the situation arising, with banker' s algorithm for system resource allocation.
-
-
0下载:
用银行家算法 ,实现资源分配 ,具有显示或打印各进程依次要求申请的资源数以及依次分配资源的情况-With the banker' s algorithm, resource allocation, with the display or print the application of the process followed by the number of resources required and the allocation of resources in order
-
-
0下载:
3、银行家算法
设request:是Pi进程的请求向量,当Pi发了资源请求后,系统按下述步骤检查:
(1)如果Request[i]<= Need[i],则转向步骤(2);
(2)若Request[i] <=Available,则转向步骤(3);
(3)系统试探性地把要求的资源分配给进程Pi,并修改以下数据结构的值:
Available=Available-Request[i];
Allocation[i]= Allocation[i]+ Request[i];
-
-
0下载:
基于资源池的与排序动态资源分配算法,是一篇可参考的文献-Based on the resource pool and sorting dynamic resource allocation algorithm
-
-
0下载:
银行家算法,死锁避免,资源拒绝分配,操作系统-Bankers algorithm, deadlock avoidance, resource allocation rejected the operating system
-
-
0下载:
关于资源分配问题的改进算法,可以根据自己需要修改。-The improved algorithm about resource allocation problem, you can modify according to their own needs.
-
-
0下载:
Belong to the resource allocation problem of subproblems, the use of c + + implementation, and analysis of algorithm study or participate in the ACM contest has certain help.-Belong to the resource allocation problem of subproblems, the use of c++ im
-
-
0下载:
操作系统按照银行家制定的规则为进程分配资源,当进程首次申请资源时,要测试该进程对资源的最大需求量,如果系统现存的资源可以满足它的最大需求量则按当前的申请量分配资源,否则就推迟分配。当进程在执行中继续申请资源时,先测试该进程本次申请的资源数是否超过了该资源所剩余的总量。若超过则拒绝分配资源,若能满足则按当前的申请量分配资源,否则也要推迟分配。(Operating system for the process of allocation of resources in accordance with
-