1、#include<iostream>#include<string.h>#include<stdio.h>#define False 0#define True 1using namespace std;int Max100100=0;/各進(jìn)程所需各類資源的最大需求int Avaliable100=0;/系統(tǒng)可用資源char name100=0;/資源的名稱int Allocation100100=0;/系統(tǒng)已分配資源int Need100100=0;/還需要資源int Request100=0;/請(qǐng)求資源向量int temp100=0;/存放安全序列int

2、 Work100=0;/存放系統(tǒng)可提供資源int M=100;/作業(yè)的最大數(shù)為100int N=100;/資源的最大數(shù)為100void showdata()/顯示資源矩陣 int i,j; cout<<"系統(tǒng)目前可用的資源Avaliable:"<<endl; for(i=0;i<N;i+) cout<<namei<<" " cout<<endl; for (j=0;j<N;j+) cout<<Avaliablej<<" "/輸出分配資源 c

3、out<<endl; cout<<" Max Allocation Need"<<endl; cout<<"進(jìn)程名 " for(j=0;j<3;j+) for(i=0;i<N;i+) cout<<namei<<" " cout<<" " cout<<endl; for(i=0;i<M;i+) cout<<" "<<i<<" "

4、for(j=0;j<N;j+) cout<<Maxij<<" " cout<<" " for(j=0;j<N;j+) cout<<Allocationij<<" " cout<<" " for(j=0;j<N;j+) cout<<Needij<<" " cout<<endl; int changdata(int i)/進(jìn)行資源分配 int j;for (j=0;j<

5、M;j+) Avaliablej=Avaliablej-Requestj; Allocationij=Allocationij+Requestj; Needij=Needij-Requestj;return 1;int safe()/安全性算法int i,k=0,m,apply,Finish100=0;int j;int flag=0;Work0=Avaliable0;Work1=Avaliable1;Work2=Avaliable2;for(i=0;i<M;i+) apply=0; for(j=0;j<N;j+) if (Finishi=False&&Needij

6、<=Workj) apply+; if(apply=N) for(m=0;m<N;m+) Workm=Workm+Allocationim;/變分配數(shù) Finishi=True; tempk=i; i=-1; k+; flag+; for(i=0;i<M;i+) if(Finishi=False) cout<<"系統(tǒng)不安全"<<endl;/不成功系統(tǒng)不安全 return -1; cout<<"系統(tǒng)是安全的!"<<endl;/如果安全，輸出成功 cout<<"分配的序列

7、:"for(i=0;i<M;i+)/輸出運(yùn)行進(jìn)程數(shù)組 cout<<tempi; if(i<M-1) cout<<"->" cout<<endl; return 0;void share()/利用銀行家算法對(duì)申請(qǐng)資源對(duì)進(jìn)行判定char ch;int i=0,j=0;ch='y'cout<<"請(qǐng)輸入要求分配的資源進(jìn)程號(hào)(0-"<<M-1<<"):" cin>>i;/輸入須申請(qǐng)的資源號(hào)cout<<&qu

8、ot;請(qǐng)輸入進(jìn)程 "<<i<<" 申請(qǐng)的資源:"<<endl;for(j=0;j<N;j+) cout<<namej<<":" cin>>Requestj;/輸入需要申請(qǐng)的資源 for (j=0;j<N;j+) if(Requestj>Needij)/判斷申請(qǐng)是否大于需求，若大于則出錯(cuò) cout<<"進(jìn)程 "<<i<<"申請(qǐng)的資源大于它需要的資源" cout<<&quo

9、t; 分配不合理，不予分配！"<<endl; ch='n' break; else if(Requestj>Avaliablej)/判斷申請(qǐng)是否大于當(dāng)前資源，若大于則 /出錯(cuò) cout<<"進(jìn)程"<<i<<"申請(qǐng)的資源大于系統(tǒng)現(xiàn)在可利用的資源" cout<<" 分配出錯(cuò)，不予分配!"<<endl; ch='n' break; if(ch='y') changdata(i);/根據(jù)進(jìn)程需求量變換資源 s

10、howdata();/根據(jù)進(jìn)程需求量顯示變換后的資源 safe();/根據(jù)進(jìn)程需求量進(jìn)行銀行家算法判斷 void addresources()/添加資源 int n,flag;cout<<"請(qǐng)輸入需要添加資源種類的數(shù)量:"cin>>n;flag=N;N=N+n;for(int i=0;i<n;i+) cout<<"名稱:" cin>>nameflag; cout<<"數(shù)量:" cin>>Avaliableflag+;showdata();safe();voi

11、d delresources()/刪除資源char ming;int i,flag=1;cout<<"請(qǐng)輸入需要?jiǎng)h除的資源名稱："do cin>>ming;for(i=0;i<N;i+) if(ming=namei) flag=0; break; if(i=N) cout<<"該資源名稱不存在，請(qǐng)重新輸入："while(flag);for(int j=i;j<N-1;j+) namej=namej+1; Avaliablej=Avaliablej+1; N=N-1;showdata();safe();voi

12、d changeresources()/修改資源函數(shù)cout<<"系統(tǒng)目前可用的資源Avaliable:"<<endl; for(int i=0;i<N;i+) cout<<namei<<":"<<Avaliablei<<endl;cout<<"輸入系統(tǒng)可用資源Avaliable:"<<endl;cin>>Avaliable0>>Avaliable1>>Avaliable2;cout<<

13、"經(jīng)修改后的系統(tǒng)可用資源為"<<endl;for (int k=0;k<N;k+) cout<<namek<<":"<<Avaliablek<<endl;showdata();safe();void addprocess()/添加作業(yè) int flag=M;M=M+1;cout<<"請(qǐng)輸入該作業(yè)的最打需求量Max"<<endl;for(int i=0;i<N;i+) cout<<namei<<":"

14、; cin>>Maxflagi; Needflagi=Maxflagi-Allocationflagi;showdata();safe();int main()/主函數(shù) int i,j,number,choice,m,n,flag;char ming;cout<<"*資源管理系統(tǒng)的設(shè)計(jì)與實(shí)現(xiàn)*"<<endl;cout<<"請(qǐng)首先輸入系統(tǒng)可供資源種類的數(shù)量:"cin>>n;N=n;for(i=0;i<n;i+) cout<<"資源"<<i+1<

15、;<"的名稱:" cin>>ming; namei=ming; cout<<"資源的數(shù)量:" cin>>number; Avaliablei=number;cout<<endl;cout<<"請(qǐng)輸入作業(yè)的數(shù)量:"cin>>m;M=m;cout<<"請(qǐng)輸入各進(jìn)程的最大需求量("<<m<<"*"<<n<<"矩陣)Max:"<<end

16、l;for(i=0;i<m;i+) for(j=0;j<n;j+) cin>>Maxij;do flag=0; cout<<"請(qǐng)輸入各進(jìn)程已經(jīng)申請(qǐng)的資源量("<<m<<"*"<<n<<"矩陣)Allocation:"<<endl; for(i=0;i<m;i+) for(j=0;j<n;j+) cin>>Allocationij; if(Allocationij>Maxij) flag=1; Needij=Ma

17、xij-Allocationij; if(flag) cout<<"申請(qǐng)的資源大于最大需求量，請(qǐng)重新輸入!n"while(flag); showdata();/顯示各種資源 safe();/用銀行家算法判定系統(tǒng)是否安全 while(choice) cout<<"*銀行家算法演示*"<<endl; cout<<" 1:增加資源 "<<endl; cout<<" 2:刪除資源 "<<endl; cout<<" 3:修改資源 "<<endl; cout<<" 4:分配資源 "<<endl; cout<<" 5:增加作業(yè) "<<endl; cout<<" 0:離開 "<<endl; cout<<"*"<<endl; cout<<"請(qǐng)選擇功能號(hào)："