操作系统内存管理模拟系统的实现

关键字：内存资源；分配；存储管理；回收

......................................................................................................

.....................................................................................

....................................................................................

....................................................................................

....................................................................................

.........................................................................................

.............................................................................

.............................................................................

...........................................................................

...........................................................................

...........................................................................

...........................................................................

...................................................................................

.............................................................................................

........................................................................

....................................................................

....................................................................

....................................................................

....................................................................

....................................................................

....................................................................

....................................................................

....................................................................

.................................................................................................

.....................................................................................................

................................................................................................

....................................................................................................

关键字：内存资源；分配；存储管理；回收

1.1

设计任务

1.2

设计思想1.3

基础知识

2.1

主程序

Y

2.2

创建进程模块

tapplyIndex=new

assignPointer=new

int[ProcessNum];//maxApplyNum=ProcessNum;

2.3

进程信息模块

return

ERROR

ifpro->status==-1

ifpro->status==-2

2.4

进程申请模块

2.5

分区创建模块

return

ERRORp=head->next

return

2.6

内存分配模块

p=head->next

if(count==1)

SIZE

Y

YY

2.7

低级调度模块

,

Randomcreatpro()

4.1

主界面调试结果

4.2

创建进程调试结果

4.3

进程信息调试结果

4.4

进程申请调试结果

4.5

分区创建调试结果

4.6

内存分配调试结果

4.7

内存回收调试结果

4.8

打印分区调试结果

4.9

低级调度调试结果

cpucpu

#include<iomanip.h>#include<time.h>

SUCCESS

ERROR

byte;

byte

subareaSize;//

}SubareaTable;//

SubareaTable

subarea;//

byte

subareaSize[num]={8,12,16,32,24,16,64,128,40,64};//

maxApplyNum=0;//

*applyIndex=NULL;//

totalApplyNum=0;//

*assignPointer=NULL;//

assignFlag=0;//

*subareaNode=new

Node[3];//

);//

orderIndex,int

flagNode);//

assignMemory(LinkList

&head);//

index);//

deleteNode(LinkList

index);//

&head);//

findSubarea(LinkList

index);//

menu();//

creatProcess();//

--------------"<<endl;

return

head->next=NULL;//

i=1;i<=n;i++){p=(Node)malloc(sizeof(node));return

start+=subareaSize[i-1];return

p=head->next;//

return

return

return

p=head;//while(p!=flag){//if(p==flag){//return

return

return

p=head->next;//

return

if(count==1){//

}while(p!=NULL);return

p=head->next;//

return

if(p->status==0){

if(count==1){//}while(p!=NULL);return

return

";return;

p=head->next;p->next=q;//j=q->subarea.index;//j

q=q->next;//j=q->subarea.index;

deleteNode(LinkList

p=head;//

return

findSubarea(LinkList

p=head->next;//return

ERROR;

for(;p;j++) if(j>=index-1)break;

i=0;i<3;i++){return

SUCCESS;

&head){// --------------"<<endl;

return

ERROR;p=head->next;

return

SUCCESS;

--------------"<<endl;return

ERROR;

cout<<i+1<<":"<<setw(6)<<pro->processSize<<" if(pro->status==0){";

if(pro->status==1){//";

if(pro->status==-1){";

if(pro->status==2){";

if(pro->status==-2){

";return

SUCCESS;

applyforProcess(){ --------------"<<endl;

return

ERROR;";cin>>applyProcessNum;cin>>applyProcessNum;

i=0;i<applyProcessNum;){cin>>index;pro+=(index-1);//if(pro->status==0){

maxApplyNum--;return

SUCCESS;

assignMemory(LinkList

&head){//

flagNode;return

ERROR;cout<<setw(10)<<"1.cout<<setw(10)<<"2.cout<<setw(10)<<"3.cout<<setw(10)<<"4.cout<<"**************************"<<endl;cin>>n;

applyIndex+=assignFlag;//

assignPointer[i]=*applyIndex;//return

SUCCESS;

orderIndex,int

flagNode){

switch(orderIndex){

pro-=index;//if(assignNode!=NULL){//

node=(Node)malloc(sizeof(node));SubareaTableprocessSize;//node->status=0;//insertNode(head,

assignNode->subarea.index+1);//assignNode->status=1;//

return

return

j=p->subarea.index;//

[1]->subarea.subareaSize);//

p=subareaNode[1];

j=p->subarea.index;

j=p->subarea.index;

callbackMemory(LinkList

char

cin>>n;}while(n!='y'&n!='Y'&n!='n'&n!='N');if(subareaNode[2]!=NULL){

amendNodedata(subareaNode[0],subareaNode[2]);

if(subareaNode[0]==NULL){a.subareaSize;

return

SUCCESS

return

ERROR;

--------------"<<endl;";return

ERROR;

cin>>n;}while(n<1||n>ProcessNum||(pro+n-1)->status!=2);(pro+n-1)->status=1;//

return

SUCCESS;

cout<<"*********************cout<<setw(30)<<"1.cout<<setw(30)<<"2.cout<<setw(30)<<"3.cout<<setw(30)<<"4.cout<<setw(30)<<"5.cout<<setw(30)<