模拟操作系统最先 最佳 最坏 内存分配算法.doc

模拟操作系统?最先?最佳??最坏?内存分配算法 (2008-04-17 03:32:37) 转载 标签： ? #includestdio.h????#includestring.h????#includeiostream?#includeiomanip?using namespace std;?const int MAXJOB=10;//定义表最大记录数typedef struct node{?int start; //起始地址?int length; //长度?char tag[20];}job; ?job frees[MAXJOB];//定义空闲区表?int free_quantity;?job occupys[MAXJOB];//定义已分配区表?int occupy_quantity; //初始化函数void initial(){?int i;?for(i=0;iMAXJOB;i++){??frees[i].start=-1;??frees[i].length=0;??strcpy(frees[i].tag,free); ??occupys[i].start=-1;??occupys[i].length=0;??strcpy(occupys[i].tag,);?}?free_quantity=0;?occupy_quantity=0;}//读数据函数int readData(){?FILE *fp;?char fname[20];?cout请输入初始空闲表文件名:;?cinfname; ?if((fp=fopen(fname,r))==NULL){?cout错误,文件打不开,请检查文件名endl;?system(pause);??}?else{??while(!feof(fp))??{??fscanf(fp,%d? %d,frees[free_quantity].start,frees[free_quantity].length);??free_quantity++;??}??free_quantity--;//去掉 ??return 1;?}?return 0;} //按起位置排序void sort(){?int i,j,p; ?for(i=0;ifree_quantity-1;i++)?{??p=i;??for(j=i+1;jfree_quantity;j++)??{??? if(frees[j].startfrees[p].start)??? {????? p=j;??? }??}?? if(p!=i){???frees[free_quantity]=frees[i];???frees[i]=frees[p];???frees[p]=frees[free_quantity];???}?}}//显示函数void view(){?int i;?coutendl----------------------------------------------------------endl;?cout当前空闲表:endl;?cout起始地址??? 长度??? 状态endl;?for(i=0;ifree_quantity;i++){?coutfrees[i].start;?cout??????? ;?coutfrees[i].length;?cout??????? ;?coutfrees[i].tagendl;?}?coutendl----------------------------------------------------------endl;?coutendl----------------------------------------------------------endl;?coutendl----------------------------------------------------------endl;?cout当前已分配表:endl;?cout起始地址??? 长度??? 占用作业名endl;?for(i=0;ioccupy_quantity;i++){?coutoccupys[i].start;?cout??????? ;?coutoccupys[i].length;?cout??????? ;?coutoccupys[i].tagendl;?}}//最先适应分配算法void earliest(){?char job_name[20];?int job_length;?int i,j,f