银行家算法源程序.docx

#includeiostream#include stdio.h#include string.husing namespace std;#define false 0#define true !false#define jcsl 5//系统中所有进程数量typedef struct {intA;intB;intC;}jc;jc Max[jcsl]={{7,5,3},{3,2,2},{9,0,2},{2,2,2},{4,3,3}};//最大需求矩阵jc Allocation[jcsl]={{0,1,0},{2,0,0},{3,0,2},{2,1,1},{0,0,2}};//已分配资源数矩阵jc Need[jcsl]={{7,4,3},{1,2,2},{6,0,0},{0,1,1},{4,3,1}};//需求矩阵jc Available={3,3,2};//可用资源向量int safe[jcsl];void ProbeAlloc(int process,jc *res)//试探分配{Available.A-=res-A;Available.B-=res-B;Available.C-=res-C;Allocation[process].A+=res-A;Allocation[process].B+=res-B;Allocation[process].C+=res-C;Need[process].A-=res-A;Need[process].B-=res-B;Need[process].C-=res-C;}void RollBack(int process,jc *res)//若试探分配后进入不安全状态，将分配回滚{Available.A+=res-A;Available.B+=res-B;Available.C+=res-C;Allocation[process].A-=res-A;Allocation[process].B-=res-B;Allocation[process].C-=res-C;Need[process].A+=res-A;Need[process].B+=res-B;Need[process].C+=res-C;}//安全性检查bool SafeCheck(){jc Work=Available;bool Finish[jcsl]={false,false,false,false,false};inti;intj=0;for(i=0;ijcsl;i++){if(Finish[i]==false)//是否已检查过{if(Need[i].A=Work.A Need[i].B=Work.B Need[i].C=Work.C)//是否有足够的资源分配给该进程{//有则使其执行完成，并将已分配给该进程的资源全部回收Work.A+=Allocation[i].A;Work.B+=Allocation[i].B;Work.C+=Allocation[i].C;Finish[i]=true;safe[j++]=i;i=-1;//重新进行遍历}}}for (i=0;ijcsl;i++)//如果所有进程的Finish向量都为true则处于安全状态，否则为不安全状态{if (Finish[i]==false){return false;}}return true;}//资源分配请求bool request(int process,jc *res){if(res-A=Need[process].A res-B=Need[process].B res-C=Need[process].C)//request向量需小于Need矩阵中对应的向量{if(res-A=Available.A res-B=Available.B res-C=Available.C)//request向量需小于Available向量{ProbeAlloc(process,res);//试探分配if(SafeCheck())//如果安全检查成立，则请求成功，否则将分配回滚并返回失败{return true;}else{cout安全性检查失败。原因：系统将进入不安全状态，有可能引起死锁.endl;RollBack(process,res);}}else{cout安全性检查失败。原因：请求向量大于可利用资源向量。endl;}}else{cout安全性检查失败。原因：请求向量大于需求向量。endl;}return false;}//输出资源分配表void PrintTable(){cout\t\t\t*********资源分配表*********endl;coutProcess Max Allocation Need