银行家算法的java编程实现汇总

1、/*死锁避免与死锁检测模拟程序【银行家算法】importjava.util.*;publicclassTestTheBankerpublicstaticvoidmain(Stringargs)Scannerscanner=newScanner(System.in);TheBankertb=newTheBanker();tb.deadlockAvoidance();/死锁避免intgate=1;while(gate!=0)tb.deadlockDetection();/死锁检测System.out.println("如果您要继续分配资源请输入"1"，退出请输入&qu

2、ot;0"");System.out.print("您输入的值为：");gate=scanner.nextInt();System.out.println();System.out.println("使用愉快！期待您下次使用！");classTheBankerintm;intn;intmax;intmaxbak;/备份用intallocation;intallocationbak;/备份用intneed;intneedbak;/备份用intavailable;intavailablebak;/备份用publicTheBanker()S

3、canners=newScanner(System.in);System.out.println("初始化=");System.out.print("请依次输入系统中的【进程数】和【资源类型数】：");m=s.nextInt();n=s.nextInt();max=newintmn;maxbak=newintmn;allocation=newintmn;allocationbak=newintmn;need=newintmn;needbak=newintmn;available=newintn;availablebak=newintn;for(inti=

4、0;i<max.length;i+)/初始化向量MAX、ALLOCATIO、NNEED、AVAILABLESystem.out.print("请依次输入第"+i+"进程的各资源数：");for(intj=0;j<maxi.length;j+)maxij=s.nextInt();maxbakij=maxij;for(inti=0;i<allocation.length;i+)System.out.print("请依次输入第"+i+"进程中已分配资源的数量：");for(intj=0;j<all

5、ocationi.length;j+)allocationij=s.nextInt();allocationbakij=allocationij;for(inti=0;i<need.length;i+)for(intj=0;j<needi.length;j+)needij=maxij-allocationij;needbakij=needij;for(inti=0;i<available.length;i+)System.out.print("请输入系统中第"+i+"种资源的剩余量：");availablei=s.nextInt();a

6、vailablebaki=availablei;System.out.println("初始化结果=");System.out.println("MAXALLOCATIONNEEDAVAILABLE");for(inti=0;i<m;i+)System.out.print("P"+i+":");for(intj=0;j<n;j+)if(maxij>9)/如果是两位数，控制格式，在数字前少输""。System.out.print(maxij+"");elseS

7、ystem.out.print(""+maxij+"");System.out.print("");for(intj=0;j<n;j+)if(allocationij>9)System.out.print(allocationij+"");elseSystem.out.print(""+allocationij+"");System.out.print("");for(intj=0;j<n;j+)if(needij>9)System

8、.out.print(needij+"");elseSystem.out.print(""+needij+"");if(i=0)System.out.print("");for(intj=0;j<n;j+)if(availablej>9)System.out.print(availablej+"");elseSystem.out.print(""+availablej+"");System.out.println();System.out.pr

9、intln("=完成初始化=");System.out.println();publicvoiddeadlockAvoidance()intsecurity=newintm;booleanparam=newbooleanm;inttar=newintn;intcount=0;intnum1=m+1;/计数器,每循环一遍所有进程就自减1intnum2=m;/计数器，每遇到一个被满足的进程就自减1while(num1>0)/如果num1=0则说明依次循环下来没有能够满足的进程，因此中止for(inti=0;i<m;i+)if(parami=false)/只有没有被满

10、足的进程才可以进入内层循环parami=true;for(intj=0;j<n;j+)tarj=availablej-needij;if(tarj<0)parami=false;if(parami=true)for(intk=0;k<n;k+)availablek=availablek+allocationik;securitycount=i;/记录以满足的进程号count+;num2-;num1-;while(num2=0)&&(num1>0)System.out.print("【安全序列】为：");for(inti=0;i<

11、m;i+)if(i=(m-1)System.out.print("P"+securityi);elseSystem.out.print("P"+securityi+"->");System.out.println();System.out.println("=【死锁避免】结束=");System.out.println();return;while(num1=0)&&(num2>0)System.out.println("抱歉！没有【安全序列】！");System.o

12、ut.println("=【死锁避免】结束=");System.out.println();return;publicvoiddeadlockDetection()Scannersc=newScanner(System.in);intkey;intsecurity=newintm;booleanparam=newbooleanm;inttemp=newintn;inttar=newintn;intcount=0;intnum1=m+1;/计数器,每循环一遍所有进程就自减1intnum2=m;/计数器，每遇到一个被满足的进程就自减1for(inti=0;i<m;i+)/

13、回复死锁检测前的状态for(intj=0;j<n;j+)maxij=maxbakij;allocationij=allocationbakij;needij=needbakij;availablej=availablebakj;System.out.println();System.out.println("死锁检测=");System.out.println("如果您此时想申请系统资源请输入【进程号】和"+n+"种【资源量】，系统将帮您判断是否可行。");System.out.print("您输入的进程号为：&quo

14、t;);key=sc.nextInt();for(inti=0;i<n;i+)System.out.print("您要申请的第"+i+"种资源的数量为：");tempi=sc.nextInt();for(inti=0;i<n;i+)allocationkeyi=allocationkeyi+tempi;needkeyi=needkeyi-tempi;if(needkeyi<0)System.out.println("申请资源大于所需资源，系统【不能】分配资源！");for(intk=0;k<m;k+)/回复死锁

15、检测前的状态for(intj=0;j<n;j+)if(k=0)availablej=availablebakj;maxkj=maxbakkj;allocationkj=allocationbakkj;needkj=needbakkj;return;availablei=availablei-tempi;if(availablei<0)System.out.println("申请资源大于系统所剩资源，系统【不能】分配资源！");for(intk=0;k<m;k+)/回复死锁检测前的状态for(intj=0;j<n;j+)if(k=0)available

16、j=availablebakj;maxkj=maxbakkj;allocationkj=allocationbakkj;needkj=needbakkj;return;System.out.println("申请资源时各进程的状态=");System.out.println("MAXALLOCATIONNEEDAVAILABLE");for(inti=0;i<m;i+)System.out.print("P"+i+":");for(intj=0;j<n;j+)if(maxij>9)System.o

17、ut.print(maxij+"");elseSystem.out.print(""+maxij+"");System.out.print("");for(intj=0;j<n;j+)if(allocationij>9)System.out.print(allocationij+"");elseSystem.out.print(""+allocationij+"");System.out.print("");for(intj

18、=0;j<n;j+)if(needij>9)System.out.print(needij+"");elseSystem.out.print(""+needij+"");if(i=0)System.out.print("");for(intj=0;j<n;j+)if(availablej>9)System.out.print(availablej+"");elseSystem.out.print(""+availablej+"");

19、System.out.println();System.out.println("=完成状态展示=");System.out.println();while(num1>0)/如果num1=0则说明依次循环下来没有能够满足的进程，因此中止for(inti=0;i<m;i+)if(parami=false)/只有没有被满足的进程才可以进入内层循环parami=true;for(intj=0;j<n;j+)tarj=availablej-needij;if(tarj<0)parami=false;if(parami=true)for(intk=0;k<n;k+)availablek=availablek+allocat