可變分區(qū)首次適應(yīng)算法(Java版)

1、運行平臺：MyEclipse使用方法：新建一個Distribution1類，粘貼代碼即可packagemypackage;importjavax.swing.JOptionPane;publicclassDistribution1voidInput()voidOutput()Suggestion=|+分區(qū)號+|+分區(qū)大小+|+起始地址+|for(intk=0;k=j;k+)Suggestion+=n|+k+|;Suggestion+=partk+|;Suggestion+=addressk+|;Suggestion+=flagk+|;+狀態(tài)+|;Suggestion=JOptionPane.s

2、howInputDialog(請輸入可分配內(nèi)存的大小：);size=Integer.parseInt(Suggestion);intsize=0;publicintj;/用于記錄內(nèi)存分塊數(shù)intpart=newint1000;/用于記錄內(nèi)存分塊的大小intaddress=newint1000;/用于記錄內(nèi)存分塊的起始地址intflag=newint1000;/用于記錄內(nèi)存分塊的分配情況StringSuggestion;for(inti=0;i1000;i+)parti=0;addressi=0;flagi=0;Distribution1()/endDistribution1()/endInpu

3、t()JOptionPane.showMessageDialog(null,Suggestion內(nèi)存分酉己情況,JOptionPane.INFORMATION_MESSAGE);/endOutput()voidBegin()chars=y;inti=0;intcount=0;Suggestion=JOptionPane.showInputDialog(請輸入內(nèi)存的起始地址：);addressi=Integer.parseInt(Suggestion);，己錄首地址Suggestion=JOptionPane.showInputDialog(請輸入第0塊分區(qū)的大小:);parti=Integer

4、.parseInt(Suggestion);/記錄第0塊分區(qū)的大小count=parti;flagi=1;i+;j+;Suggestion=JOptionPane.showInputDialog(是否繼續(xù)分塊，是請輸入y或Y,s=Suggestion.charAt(0);while(s=y|s=Y)Suggestion=JOptionPane.showInputDialog(胄輸入第+i+”塊分區(qū)的大小parti=Integer.parseInt(Suggestion);if(size-countparti)elseSuggestion=JOptionPane.showInputDialog(

5、b否繼續(xù)，是請輸入y或Y,s=Suggestion.charAt(0);addressi=addressi-1+parti-1;flagi=1;count=count+parti;i+;j+;JOptionPane.showMessageDialog(null,剩余空間不足以分配！);否請輸入任意字符：););否則請輸入任意的字符：);/while(s=y|s=Y)parti=size-count;addressi=addressi-1+parti-1;flagi=0;/endBegin()voidRestore()可作改進，在Suggestion中輸入所有要回收的內(nèi)存塊，再將其解析出來。ch

6、ars;inti;intk=0;intcount=0;inttag=0;intnumber=0,1,2,3,4,5,6,7,8,9;Suggestion=JOptionPane.showInputDialog(是否要回收內(nèi)存，是請輸入y或Y,否請輸入任意的字符：);s=Suggestion.charAt(0);if(s=y|s=Y)Suggestion=JOptionPane.showInputDialog(請輸入要回收的內(nèi)存塊號，for(i=0;iSuggestion.length();i+)if(Suggestion.charAt(i)!=)/for(k=0;kj)JOptionPane.

7、showMessageDialog(null,輸入的內(nèi)存號不存在，請重新輸入!,Warning,JOptionPane.INFORMATION_MESSAGE);continue;elseflagtag=0;tag=0;/for/iffor(i=1；i=j；i+)/合并連續(xù)的空閑空間5/ 7(if(flagi-1=0&flagi=0)(parti-1=parti-1+parti;count+;for(k=i;k=j;k+)(partk=partk+1;addressk=addressk+1;/for/if/forfor(i=1;i=j;i+)/移動flag數(shù)組的元素(if(flagi-1=0&flagi=0)(for(k=i;k=j;k+)(flagk=flagk+1;/for/if/forj=j-count;/endRestore()publicstaticvoidmain(Stringarg)JOptionPane.showMessageDialog(null,ttttt可變分區(qū)首次適應(yīng)算Distribution1distribute=newDistribution1();distribute.Input();distribute.Begin()