操作系統(tǒng)實(shí)驗(yàn)報(bào)告(銀行家算法c語(yǔ)言描述)

1/7洛陽(yáng)理工學(xué)院實(shí)驗(yàn)報(bào)告系別計(jì)算機(jī)系班級(jí)學(xué)號(hào)姓名課程名稱(chēng)計(jì)算機(jī)操作系統(tǒng)實(shí)驗(yàn)日期2012/11/21實(shí)驗(yàn)名稱(chēng)銀行家算法成績(jī)實(shí)驗(yàn)?zāi)康模毫私膺M(jìn)程產(chǎn)生死鎖的原因，了解為什么要進(jìn)行死鎖的避免。掌握銀行家算法的數(shù)據(jù)結(jié)構(gòu)，了解算法的執(zhí)行過(guò)程，加深對(duì)銀行家算法的理解。實(shí)驗(yàn)條件：微計(jì)一臺(tái)、MicrosoftVisualStudio2008實(shí)驗(yàn)原理：n個(gè)并發(fā)進(jìn)程共享m個(gè)系統(tǒng)資源的系統(tǒng)，進(jìn)程可動(dòng)態(tài)申請(qǐng)資源和釋放資源。系統(tǒng)按各進(jìn)程的申請(qǐng)動(dòng)態(tài)的分配資源，先對(duì)用戶提出的請(qǐng)求進(jìn)行合法性檢查，再進(jìn)行預(yù)分配，利用安全性檢測(cè)算法進(jìn)行安全性檢測(cè)，如果系統(tǒng)分配資源，系統(tǒng)進(jìn)入安全狀態(tài)，則預(yù)分配就是正式分配，如果系統(tǒng)分配資源，系統(tǒng)進(jìn)入不安全狀態(tài)，則撤銷(xiāo)預(yù)分配。實(shí)驗(yàn)內(nèi)容：#include<stdio.h>#include<string.h>#include"common.h"voidInint(int*,int*);voidrequestPredistribution(int,int*,int);//請(qǐng)求預(yù)分配voidrollbackPredistribution(int,int*,int);boolsafe(int,int);boolIsValidate(int,int*,int,int);voiddisplayInfo(int,int);voidmain(){ intprocess,resource,total,processNum,resourceNum; charch; boolisSafe=false,valid=false; do{ Inint(&processNum,&resourceNum); printf("T0時(shí)刻安全性："); if(safe(processNum,resourceNum)) { isSafe=true; printf("存在安全序列故系統(tǒng)是安全的！\n安全序列為:"); for(inti=0;i<processNum;++i) { printf("P%d",safeSequence[i]); } printf("\n"); } if(!isSafe) { printf("T0時(shí)刻系統(tǒng)是不安全的，后續(xù)請(qǐng)求也沒(méi)意義！重新輸入數(shù)據(jù):\n"); } }while(!isSafe); printf("T0時(shí)刻的安全序列\(zhòng)n"); displayInfo(processNum,resourceNum); do { do { printf("輸入用戶的多元請(qǐng)求組（i，r0,r1……rn）i為進(jìn)程r0-n為各類(lèi)資源個(gè)數(shù):\n"); scanf("%d",&process); for(inti=0;i<resourceNum;++i) { scanf("%d",&Request[i]); } valid=IsValidate(process,Request,processNum,resourceNum); if(!valid) { printf("請(qǐng)求進(jìn)程不存在或請(qǐng)求資源大于最大需求\n"); } }while(!valid); requestPredistribution(process,Request,resourceNum); if(safe(processNum,resourceNum)) { printf("P%d進(jìn)程資源申請(qǐng)成功！\n安全序列為:",process); for(inti=0;i<processNum;++i) { printf("P%d",safeSequence[i]); } printf("P%d申請(qǐng)資源時(shí)的安全性檢查¨|\n",processNum); displayInfo(processNum,resourceNum); } else { rollbackPredistribution(process,Request,resourceNum); printf("安全序列不存在系統(tǒng)不予分配!\n"); } printf("是否退出[Y/N]"); fflush(stdin); ch=getchar(); }while(ch!='Y'&&ch!='y'); getchar();}voidInint(int*processNum,int*resourceNum){ intnum,type; printf("輸入進(jìn)程數(shù)量和資源種類(lèi):"); scanf("%d%d",&num,&type); *processNum=num; *resourceNum=type; printf("輸入各類(lèi)資源可用量:"); for(intj=0;j<type;++j) { scanf("%d",&Available[j]); } for(inti=0;i<num;++i) { printf("輸入進(jìn)程P%d已分配及還需各類(lèi)資源數(shù)量,i); for(intj=0;j<type;++j) { scanf("%d",&Allocation[i][j]); } for(intj=0;j<type;++j) { scanf("%d",&Need[i][j]); } }}boolIsValidate(intprocess,int*requestResource,intprocessNum,intresourceNum){ if(process>processNum) { returnfalse; } for(inti=0;i<resourceNum;++i) { if(requestResource[i]>Need[process][i]||requestResource[i]>Available[process]) returnfalse; } returntrue;}voidrequestPredistribution(intprocess,int*requestResorce,intresourceNum)//請(qǐng)求預(yù)分配{ for(inti=0;i<resourceNum;++i) { Available[i]=Available[i]-Request[i]; Allocation[process][i]=Allocation[process][i]+Request[i]; Need[process][i]=Need[process][i]-Request[i]; }}voidrollbackPredistribution(intprocess,int*requestResorce,intresourceNum){ for(inti=0;i<resourceNum;++i) { Available[i]=Available[i]+Request[i]; Allocation[process][i]=Allocation[process][i]-Request[i]; Need[process][i]=Need[process][i]+Request[i]; }}boolsafe(intprocessNum,intresourceNum){ intnum=0,count=0,item=0; memset(safeSequence,-1,sizeof(safeSequence)); for(inti=0;i<resourceNum;++i) { Work[i]=Available[i]; } for(inti=0;i<processNum;++i) { Finish[i]=false; } for(inti=0;i<processNum;++i) { for(intj=0;j<processNum;++j) { count=0; if(!Finish[j]) { for(intk=0;k<resourceNum;++k) { if(Need[j][k]<=Work[k]) { ++count; } } if(count==resourceNum) { for(intk=0;k<resourceNum;++k) { tempWork[j][k]=Work[k]; Work[k]=Work[k]+Allocation[j][k]; } Finish[j]=true; safeSequence[item++]=j; break; } } } } for(inti=0;i<processNum;++i) { if(!Finish[i]) { returnfalse; } } returntrue;}voiddisplayInfo(intprocessNum,intresourceNum){ printf("|資源情況\tWork\tNeed\tAllocation\tFinish\n進(jìn)程|___________________________________________________________________\n"); for(inti=0;i<processNum;++i) { intprocess=safeSequence[i]; printf("P%d",process); printf("\t\t"); for(intj=0;j<resourceNum;++j) { printf("%d",tempWork[process][j]); } printf("\t"); for(intj=0;j<resourceNum;++j) { printf("%d",Need[process][j]); } printf("\t\t"); for(intj=0;j<resourceNum;++j) { printf("%d",Allocation[process][j]); } printf("\t"); printf(Finish[i]?"true":"false"); printf("\n"); }}//common.h#defineM10#defineN10#definex10#definey10intAvailable[M];//M為資源的類(lèi)型intAllocation[N][M];intNeed[N][M];int