操作系统实验四动态分区分配算法源代码最全

1、 实验四 操作系统-动态分区分配算法萨斯的发生的v设计程序模拟四种动态分区分配算法：首次适应算法、循环首次适应算法、最佳适应算法和最坏适应算法的工作过程。假设内存中空闲分区个数为n，空闲分区大小分别为P1, ,Pn，在动态分区分配过程中需要分配的进程个数为m（mn），它们需要的分区大小分别为S1, ,Sm，分别利用四种动态分区分配算法将m个进程放入n个空闲分区，给出进程在空闲分区中的分配情况。程序要求如下：1）利用首次适应算法、循环首次适应算法、最佳适应算法和最坏适应算法四种动态分区分配算法模拟分区分配过程。2）模拟四种算法的分区分配过程，给出每种算法进程在空闲分区中的分配情况。3）输入：空闲

2、分区个数n，空闲分区大小P1, ,Pn，进程个数m，进程需要的分区大小S1, ,Sm，算法选择1-首次适应算法，2-循环首次适应算法，3-最佳适应算法，4-最坏适应算法。4）输出：最终内存空闲分区的分配情况。代码实现：#include<iostream>#include<fstream>#include<iomanip>using namespace std;const int MaxNumber=100;int FreePartitionMaxNumber;/空闲分区大小int FirstPartitionMaxNumber;/1-首次适应算法int Cy

3、cleFirstPartitionMaxNumber;/2-循环首次适应算法int BestPartitionMaxNumber;/3-最佳适应算法int WorstPartitionMaxNumber;/4-最坏适应算法int ProcessNeedMaxNumber;/进程需要的分区大小int PartitionNum,ProcessNum;char ProcessNameMaxNumber;/进程名char ProcessPartitionMaxNumber;/进程分配的序列int PartitionMaxNumber;char strMaxNumberMaxNumber;void Fi

4、rstFit(int n,int m);void NextFit(int n,int m);void BestFit(int n,int m);void WorstFit(int n,int m);void Print(int n, int m);void Print2(int n, int m);/=void FirstFit(int n, int m)cout<<"选择了首次适应算法!"<<endl;cout<<endl;int i,j,k=0;for(i=0; i<n; i+)FirstPartitioni = FreePar

5、titioni;for(j=0; j<m; j+)for(i=0; i<n; i+)if(ProcessNeedj<=FirstPartitioni)ProcessPartitionj=i;/strik = ProcessNamej;FirstPartitioni = FirstPartitioni-ProcessNeedj;break;Print(n,m);cout<<"空间序号:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m-

6、1)<<"空间"<<(i+1);cout<<endl;cout<<"分区大小:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m)<<setiosflags(ios:left)<<FreePartitioni;cout<<endl;cout<<"剩余分区大小:"for(i=0; i<n; i+)cout<<&qu

7、ot;|"<<setw(m)<<setiosflags(ios:left)<<FirstPartitioni;cout<<endl;Print2(n,m);void NextFit(int n, int m)cout<<"选择了循环首次适应算法!"<<endl;cout<<endl;int i,j,flag=0;for(i=0; i<n; i+)CycleFirstPartitioni = FreePartitioni;for(j=0; j<m; j+)for(i=fl

8、ag; i<n; i+)if(ProcessNeedj<=CycleFirstPartitioni)ProcessPartitionj=i;CycleFirstPartitioni = CycleFirstPartitioni-ProcessNeedj;flag = i+1;if(i=n-1)flag=0;break;Print(n,m);cout<<"空间序号:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m-1)<<&qu

9、ot;空间"<<(i+1);cout<<endl;cout<<"分区大小:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m)<<setiosflags(ios:left)<<FreePartitioni;cout<<endl;cout<<"剩余分区大小:"for(i=0; i<n; i+)cout<<"|"<

10、;<setw(m)<<setiosflags(ios:left)<<CycleFirstPartitioni;cout<<endl;Print2(n,m);void BestFit(int n, int m)cout<<"选择了最佳适应算法!"<<endl;cout<<endl;int i,j,flag=0,temp,id=0,flag1=0;for(i=0; i<n; i+)BestPartitioni = FreePartitioni;while(flag1<m)flag = 0;

11、for(i=0; i<n; i+)Partitioni=0;for(i=0; i<n; i+)if(ProcessNeedflag1<=BestPartitioni)Partitionflag=i;flag += 1; temp = BestPartitionPartition0; id = Partition0; for(i=1; i<flag; i+) if(temp > BestPartitionPartitioni) temp = BestPartitionPartitioni; id = Partitioni; BestPartitionid=BestP

12、artitionid-ProcessNeedflag1; ProcessPartitionflag1=id; flag1 += 1;Print(n,m);cout<<"空间序号:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m-1)<<"空间"<<(i+1);cout<<endl;cout<<"分区大小:"<<" "for(i=0;

13、 i<n; i+)cout<<"|"<<setw(m)<<setiosflags(ios:left)<<FreePartitioni;cout<<endl;cout<<"剩余分区大小:"for(i=0; i<n; i+)cout<<"|"<<setw(m)<<setiosflags(ios:left)<<BestPartitioni;cout<<endl;Print2(n,m);void Wo

14、rstFit(int n, int m)cout<<"选择了最坏适应算法!"<<endl;cout<<endl;int i,j,flag=0,temp,id=0,flag1=0;for(i=0; i<n; i+)WorstPartitioni = FreePartitioni;while(flag1<m)flag = 0;for(i=0; i<n; i+)Partitioni=0;for(i=0; i<n; i+)if(ProcessNeedflag1<=WorstPartitioni)Partitionfl

15、ag=i;flag += 1; temp = WorstPartitionPartition0; id = Partition0; for(i=1; i<flag; i+) if(WorstPartitionPartitioni > temp) temp = WorstPartitionPartitioni; id = Partitioni; WorstPartitionid=WorstPartitionid-ProcessNeedflag1; ProcessPartitionflag1=id; flag1 += 1;Print(n,m);cout<<"空间序

16、号:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m-1)<<"空间"<<(i+1);cout<<endl;cout<<"分区大小:"<<" "for(i=0; i<n; i+)cout<<"|"<<setw(m)<<setiosflags(ios:left)<<FreeParti

17、tioni;cout<<endl;cout<<"剩余分区大小:"for(i=0; i<n; i+)cout<<"|"<<setw(m)<<setiosflags(ios:left)<<WorstPartitioni;cout<<endl;Print2(n,m); void choice(int n, int m)int intput;cout<<"n请选择：1.首次适应算法 2.循环首次适应算法 3.最佳适应算法 4.最坏适应算法:"

18、<<endl;cin>>intput;cout<<endl;switch(intput)case 1:FirstFit(n,m);choice(n,m);break;case 2:NextFit(n,m);choice(n,m);break;case 3:BestFit(n,m);choice(n,m);break;case 4:WorstFit(n,m);choice(n,m);break;cout<<endl;void Print(int n, int m)int j;cout<<"进程名: "for(j=0; j<m; j+ )cout<<"|"<<setw(m)<<setiosflags(ios:left)<<ProcessNamej;cout<<endl;cout<<"进程分区大小:"for(j=0; j<m; j+ )cout<<"|"<<setw(m)<<setiosflags(ios:left)<<Process