操作系统---银行家算法.doc

/*操作系统-银行家算法*/#define M 100#define N 100#includeint maxMM,allocationMM,needMM,availableM; int i,j,n,m,r; /*m,j为资源数目，n,i为进程数,r为判断是否安全标志*/*安全性检测*/void test()int workM,aM; /*aM记录执行的顺序*/int k,flag,v; /*flag检测进程是否满足两条件*/ char finishN;r=1;v=0; /*假设一开始安全*/for(j=0;jm;j+)workj=availablej; for(i=0;i0) /*进行n趟判断，并记录顺序*/for(i=0;in;i+) /*寻找一个满足俩条件的进程*/ if(finishi=f) flag=1; /*满足条件1*/ for(j=0;jworkj)/*不满足条件2*/flag=0; if(flag=1) /*满足俩个条件*/for(j=0;jm;j+)workj+=allocationij; finishi=t; av=i; v+; k-;flag=1;for(i=0;in;i+)if(finishi=f)flag=0;if(flag=0)/*判断是否安全*/printf(系统处于不安全状态.n);r=0;elseprintf(系统处于安全状态n安全顺序为：n); /*输出安全状态的顺序*/for(i=0;in;i+)printf(%d,ai);printf(n);printf(目前的分配矩阵allocation为n);for(i=0;in;i+)for(j=0;jm;j+)printf(%5d,allocationij);printf(n);printf(目前的需求矩阵need为n);for(i=0;in;i+)for(j=0;jm;j+)printf(%5d,needij);printf(n);/*资源、进程输入输出*/void main()int p=0,q=0; /*用于判断requestM是否满足条件*/int requestMM,allocation_1MM,need_1MM,available_1M;printf(请输入进程数目：); scanf(%d,&n);printf(请输入资源种类：);scanf(%d,&m);printf(请输入可利用资源向量availablen);for(j=0;jm;j+)scanf(%d,&availablej);printf(请输入最大需求矩阵maxn);for(i=0;in;i+)for(j=0;jm;j+)scanf(%d,&maxij);printf(请输入分配矩阵allocationn);for(i=0;in;i+)for(j=0;jm;j+)scanf(%d,&allocationij);printf(则需求矩阵为n);for(i=0;in;i+)for(j=0;jm;j+)needij=maxij-allocationij;printf(%5d,needij);printf(n);/*请求资源*/test();if(r=1)while(1)printf(请输入请求资源的进程（0%d）：,n-1); scanf(%d,&i);printf(请输入请求的资源数n); /*输入requestij*/for(j=0;jm;j+)scanf(%d,&requestij);for(j=0;jneedij)q=1;if(q=1)printf(它所需资源已超过它宣布的最大值n);elsefor(j=0;jm;j+)if(requestij=availablej)p=1;if(q=1)printf(资源不足，进程%d需等待n,i);else /*request满足俩条件，试探性分配*/for(j=0;jm;j+)available_1j=availablej;allocation_1ij=allocationij;need_1ij=needij;availablej-=requestij;allocationij+=requestij;needij-=requestij;test();if(r=0)for(j=0;jm;j+)availablej=available_1j;allocationij=allocation_1ij;needij