可变分区首次适应算法(Java版).docx

运行平台：MyEclipse使用方法：新建一个Distribution1类，粘贴代码即可package mypackage;import javax.swing.JOptionPane;public class Distribution1 int size=0;public int j;/用于记录内存分块数int part=new int1000;/用于记录内存分块的大小int address=new int1000;/用于记录内存分块的起始地址int flag=new int1000;/用于记录内存分块的分配情况String Suggestion; Distribution1()for(int i=0;i1000;i+)parti=0;addressi=0;flagi=0;/ end Distribution1() void Input()Suggestion=JOptionPane.showInputDialog(请输入可分配内存的大小：);size=Integer.parseInt(Suggestion); /end Input() void Output() Suggestion=| +分区号+ | +分区大小+ | +起始地址+ | +状态+ |; for(int k=0;k=j;k+) Suggestion+=n| +k+ | ; Suggestion+=partk+ | ; Suggestion+=addressk+ | ; Suggestion+=flagk+ |; JOptionPane.showMessageDialog(null, Suggestion,内存分配情况,JOptionPane.INFORMATION_MESSAGE); /end Output() void Begin()char s=y;int i=0;int count=0;Suggestion=JOptionPane.showInputDialog(请输入内存的起始地址：);addressi=Integer.parseInt(Suggestion);/记录首地址Suggestion=JOptionPane.showInputDialog(请输入第0块分区的大小：);parti=Integer.parseInt(Suggestion);/记录第0块分区的大小count=parti;flagi=1;i+;j+;Suggestion=JOptionPane.showInputDialog(是否继续分块，是请输入y或Y，否请输入任意字符：);s=Suggestion.charAt(0);while(s=y|s=Y)Suggestion=JOptionPane.showInputDialog(请输入第+i+块分区的大小);parti=Integer.parseInt(Suggestion);if(size-countparti)JOptionPane.showMessageDialog(null, 剩余空间不足以分配！);elseaddressi=addressi-1+parti-1;flagi=1;count=count+parti;i+;j+;Suggestion=JOptionPane.showInputDialog(是否继续，是请输入y或Y，否则请输入任意的字符：);s=Suggestion.charAt(0);/while(s=y|s=Y)parti=size-count;addressi=addressi-1+parti-1;flagi=0; /end Begin() void Restore()/可作改进，在Suggestion中输入所有要回收的内存块，再将其解析出来。 char s; int i; int k=0; int count=0; int tag=0; int number=0,1,2,3,4,5,6,7,8,9; Suggestion=JOptionPane.showInputDialog(是否要回收内存，是请输入y或Y，否请输入任意的字符：); s=Suggestion.charAt(0); if(s=y|s=Y) Suggestion=JOptionPane.showInputDialog(请输入要回收的内存块号，中间以空格相间并以空格结尾：); for(i=0;iSuggestion.length();i+) if(Suggestion.charAt(i)!= )/ for(k=0;kj) JOptionPane.showMessageDialog(null,输入的内存号不存在，请重新输入！,Warning,JOptionPane.INFORMATION_MESSAGE); continue; else flagtag=0; tag=0; /for /if for(i=1;i=j;i+)/合并连续的空闲空间 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 /for for(i=1;i=j;i+)/移动flag数组的元素 if(flagi-1=0&flagi=0) for(k=i;k=j;k+)flagk=flagk+1;/for /if /for j=j-count; /end Restore()public static void main(String arg)JOptionPane.showMessageDialog(null, ttttt可变分区首次适应算法,Title,JOptionPane.INFORMATION_MESSAGE);Distribution1 distribute=new Di