能运行的银行家算法

1、#include"stdio.h"#define FALSE 0#define TRUE 1#define W 10#define R 20int M ; /*总进程数*/int N ; /*资源种类*/int ALL_RESOURCEW;/*各种资源的数目总和*/int MAXWR; /*M个进程对N类资源最大资源需求量*/int AVAILABLER; /*系统可用资源数*/int ALLOCATIONWR; /*M个进程已经得到N类资源的资源量*/int NEEDWR; /*M个进程还需要N类资源的资源量*/int REQUESTR; /*请求资源个数*/*函数名：o

2、utput*功能：输出资源分配情况*/void output()int i,j;printf("All Resource:n");for(j = 0 ; j < N ;j+)printf("R%d:%dn", j , ALL_RESOURCEj);printf("Resource Available:n");for(j = 0 ; j < N ; j+)printf("R%d:%dn", j , AVAILABLEj);printf("Process Resource Needed:n&quo

3、t;);printf("| PID |");for(j = 0 ; j < N ; j+)printf(" R%d |", j);printf("n");for(i = 0 ; i < M ; i+)for(i = 0 ; i < M ; i+)printf("|%-5d|", i);for(j = 0 ; j < N ; j+)printf("%-4d|", NEEDij);printf("n");printf("Process Resou

4、rce Allocated:n");printf("| PID |");for(j = 0 ; j < N ; j+)printf(" R%d |", j);printf("n");for(i = 0 ; i < M ; i+) printf("|%-5d|", i);for(j = 0 ; j < N ; j+)printf("%-4d|", ALLOCATIONij); printf("n");/*output*/*函数名 ：modify*功能

5、：改变可用资源和已经拿到资源和还需要的资源的值*参数：int k 修改编号为K的P的数据*/void modify(int k)int j;for(j = 0 ; j < N ; j+)/*修改数据*/ AVAILABLEj = AVAILABLEj - REQUESTj;/*修改可用资源*/ ALLOCATIONkj = ALLOCATIONkj + REQUESTj;/*修改分配资源*/ NEEDkj = NEEDkj - REQUESTj;/*修改资源需求*/*函数名：undo*功能：复原可用资源和已经拿到资源和还需要的资源的值*参数：参数：int k 修改编号为K的P的数据*/v

6、oid undo(int k)int j;for(j = 0 ; j < N ; j+)/*修改数据*/ AVAILABLEj = AVAILABLEj + REQUESTj; /*修改可用数据*/ ALLOCATIONkj = ALLOCATIONkj - REQUESTj; /*修改分配的资源*/ NEEDkj = NEEDkj + REQUESTj;/*修改资源需求*/ /*函数名：chkerr*功能：检查修改操作是否平安*/int chkerr(int s)int WORK , FINISHW;int i , j;for(i = 0 ; i < M ; i+)/*清空FIN

7、ISH*/FINISHi = FALSE;for(j = 0 ; j < N ; j+)/*逐一检查*/WORK = AVAILABLEj;i = s;doif(FINISHi = FALSE && NEEDij <= WORK)/*符合条件？*/WORK = WORK + ALLOCATIONij;FINISHi = TRUE;i = 0;elsei+;while(i<M);for(i = 0 ; i < M ; i+)/*只要一个不满足，不平安*/if(FINISHi = FALSE)printf("Error : UnSafe Alloc

8、ation!n");return 1; printf("OK : Allocation OKn");return 0;/*函数名：bank*功能 ：银行家算法的实现*/void bank()int i , j;int flag = TRUE;printf("Use Ctrl+C break.n");while(TRUE)i = -1;while(i < 0 | i >= M)printf("Input Process to Allocat PID="); scanf("%d", &i)

9、; if(i < 0 | i >= M)printf("Error: Invalid Input!n");printf("Input Resource Needn"); for (j = 0 ; j < N ; j+) printf("R%d=", j);scanf("%d", &REQUESTj);if(REQUESTj > NEEDij)/*请求的资源数大于请求资源*/printf("Error: Invalid Input!n");flag = FALSE;

10、elseif(REQUESTj>AVAILABLEj)/*假设请求的资源数大于可用资源数*/printf("Error: Invalid Input!n");flag = FALSE;/*else*/ /*for*/ if(flag) modify(i); /*修改资源数*/if(chkerr(i)/*平安?*/undo(i); /*恢复资源数*/output();/*输出*/elseoutput(); /*输出*/ elseoutput();/*while*/*bank*/*主函数*/int main()int i , j , p;printf("Inpu

11、t Process Numbers M=");/*进程数量*/scanf("%d", &M);printf("Input Resource Category N=");/*资源种类*/scanf("%d", &N);printf("Input Number of All Resource each Category:n");/*资源数目*/for(i = 0 ; i < N ; i+)scanf("%d", &ALL_RESOURCEi);printf(&

12、quot;Input Max Resource Process Need:n");/*最大资源需求*/for (i = 0 ; i < M ; i+)for (j = 0 ; j < N ; j+)doscanf("%d", &MAXij);if (MAXij > ALL_RESOURCEj)/*大于最大可用？*/printf("nError: Invalid Input!n"); while (MAXij > ALL_RESOURCEj); /*for*/printf("Input Resource

13、Process Allocated:n");for (i = 0 ; i < M ; i+)for (j = 0 ; j < N ; j+)doscanf("%d", &ALLOCATIONij);if (ALLOCATIONij > MAXij)/*大于最大需求？*/printf("nError: Invalid Input!n");while (ALLOCATIONij > MAXij); /*for*/for(j = 0 ; j < N ; j+)p = ALL_RESOURCEj;for(i = 0 ; i < M ; i+)p -= ALLOCATIONij;/*减去已经分配资源*/