内存分配算法实验报告(3)

{ for(j=i;j

cout<

//最优适应分配算法 void excellent() {

//空闲分区按大小递增的顺序排列 char job_name[20]; int job_length; int i,j,flag,t;

cout<>job_name; cin>>job_length; flag=0;

for(i=0;i=job_length){ flag=1; } }

if(flag==0){

cout<

if(frees[i].length>=job_length){

11

t=1; } i++; } i--;

for(j=0;j

if((frees[j].length>=job_length)&&(frees[j].length

occupys[occupy_quantity].start=frees[i].start; strcpy(occupys[occupy_quantity].tag,job_name); occupys[occupy_quantity].length=job_length; occupy_quantity++;

if(frees[i].length>job_length){ frees[i].start+=job_length; frees[i].length-=job_length; } else{

for(j=i;j

cout<

//最坏适应算法 void worst() {

//空闲分区按大小递减的顺序排列 char job_name[20]; int job_length;

12

int i,j,flag,t;

cout<>job_name; cin>>job_length; flag=0;

for(i=0;i=job_length) flag=1; }

if(flag==0)

cout<

if(frees[i].length>=job_length) t=1; i++;} i--;

for(j=0;j

if((frees[j].length>=job_length)&&(frees[j].length>frees[i].length)) i=j; }

occupys[occupy_quantity].start=frees[i].start; strcpy(occupys[occupy_quantity].tag,job_name); occupys[occupy_quantity].length=job_length; occupy_quantity++;

13

if(frees[i].length>job_length) {

frees[i].start+=job_length; frees[i].length-=job_length; } else {

for(j=i;j

frees[j]=frees[j+1]; }

free_quantity--;

cout<

//撤消作业 void finished() { char job_name[20]; int i,j,flag,p=0; int start; int length;

cout<>job_name;

flag=-1;

for(i=0;i

14

flag=i;

start=occupys[i].start; length=occupys[i].length; } }

if(flag==-1){

cout<<\没有这个作业名\else {

//加入空闲表

for(i=0;i

if((frees[i].start+frees[i].length)==start)//上空

{ if(((i+1)

frees[i].length=frees[i].length+frees[i+1].length+length; for(j=i+1;j

frees[i].length+=length; //上空且下不空 p=1; } }

if(frees[i].start==(start+length)) { //下空 frees[i].start=start; frees[i].length+=length; p=1; } }

//空闲中没有 if(p==0){

frees[free_quantity].start=start;

15