《动态页式存储管理的模拟实现C语言》由会员分享，可在线阅读，更多相关《动态页式存储管理的模拟实现C语言（7页珍藏版）》请在金锄头文库上搜索。
1、在内存划出一块区域，并进行页面划分；设计请求页表；模拟页面分配；分别模拟“先进先出页面淘汰算法FIFO”、“最近最少使用页面淘汰算法LRU”和“理想型淘汰算法OPT”本程序随机产生请求序列，分别模拟FIFO,LRU,OPT三种算法。将结果保存在FIFO.txt,LRU.txt,OPT.txt三个文件中。程序代码：#include#include#include#defineN20#defineP3structDuLNodeintdata;structDuLNode*prior;structDuLNode*next;intpageFIFON+1;intfront=0,rear=0;intpage
2、ingN+1,pmemP+1;intmemcount=1;voidinit(inta,intT)inti;for(i=0;i=T;i+)ai=-2;intinsert_item(intitem,intqueue,intT)if(rear+1)%(T+1)=front)return1;queuerear=item;rear=(rear+1)%(T+1);return0;intremove_item(int*item,intqueue,intT)if(front=rear)return1;*item=queuefront;front=(front+1)%(T+1);return0;intfindi
3、f(inta,intb,intT)inti;for(i=1;i=T;i+)if(ai=b)returni;return-1;voidinsertintomem(inta,intb,intn)if(memcount=P)amemcount=b;memcount+;elsean=b;voidinitpage(intpage)inttemp,i;srand(unsigned)time(0);for(i=1;idata=e;add-prior=p-prior;p-prior-next=add;add-next=p;p-prior=add;intgetI(structDuLNode*p,inte)int
4、i;structDuLNode*cd=p;for(i=1;i+)cd=cd-next;if(cd-data=e)returni;if(cd=p)return-1;voiddeleLink(structDuLNode*p,inti,int*e)intn;structDuLNode*cd=p;for(n=1;nnext;*e=cd-data;cd-prior-next=cd-next;cd-next-prior=cd-prior;free(cd);voidremovebottom(structDuLNode*p,int*e)structDuLNode*cd=p-next;*e=cd-data;cd
5、-next-prior=p;p-next=cd-next;free(cd);intgetcount(inta,intb,intn,intT)inti;for(i=n;i=T;i+)if(ai=b)return(i-n);return-1;voidgetreplacepage(inta,intb,inti,int*e)intt,cP+1,temp,T,count=0,errorP+1;for(t=1;t=P;t+)if(getcount(a,bt,i,N)!=-1)ct=getcount(a,bt,i,N);elseerror+count=bt;if(count=0)temp=c1;T=b1;f
6、or(t=1;ttemp)temp=ct;T=bt;*e=T;elsefor(t=1;t=count;t+)ct=findif(a,errort,N);temp=c1;T=error1;for(t=1;t=count;t+)if(ctprior=p-next=p;initpage(pageing);init(pmem,P);if(fp1=fopen(FIFO.txt,a)=NULL)printf(不能打开文件！n);exit(1);for(i=1;i=N;i+)fprintf(fp1,%d,pageingi);fprintf(fp1,n);for(i=1;iP&findif(pmem,page
7、ingi,P)=-1)remove_item(&temp,pageFIFO,N);insertintomem(pmem,pageingi,findif(pmem,temp,P);insert_item(pageingi,pageFIFO,N);fprintf(fp1,%d被引用，%d被替换-出现第%d次错误n,pageingi,temp,+error);elseif(memcount出现第%d次错误n,pageingi,+error);elsefprintf(fpl,%d已在页中-未出现错误。n,pageingi);fclose(fpl);ErrorC0=error;memcount=l;er
8、ror=0;init(pmem,P);if(fp2=fopen(LRU.txt,a)=NULL)printf(不能打开文件！n);exit(1);for(i=1;i=N;i+)fprintf(fp2,%d,pageingi);fprintf(fp2,n);for(i=1;iP&findif(pmem,pageingi,P)=-1)removebottom(p,&temp);insertintomem(pmem,pageingi,findif(pmem,temp,P);if(getI(p,pageingi)!=-1)deleLink(p,getI(p,pageingi),&temp1);addt
9、oLink(p,pageingi);fprintf(fp2,%d被引用，%d被替换-出现第%d次错误n,pageingi,temp,+error);elseif(memcount出现第%d次错误n,p-prior-data,+error);elsedeleLink(p,getI(p,pageingi),&temp1);addtoLink(p,pageingi);fprintf(fp2,%d已在页中-未出现错误。n,pageingi);fclose(fp2);ErrorC1=error;memcount=1;error=0;init(pmem,P);if(fp3=fopen(OPT.txt,a)
10、=NULL)printf(不能打开文件！n);exit(1);for(i=1;i=N;i+)fprintf(fp3,%d,pageingi);fprintf(fp3,n);for(i=1;iP&findif(pmem,pageingi,P)=-1)getreplacepage(pageing,pmem,i,&temp);insertintomem(pmem,pageingi,findif(pmem,temp,P);fprintf(fp3,%d被引用，%d被替换-出现第%d次错误n,pageingi,temp,+error);elseif(memcount出现第%d次错误n,pageingi,+error);elsefprintf(fp3,%d已在页中-未出现错误。n,pageingi);ErrorC2=error;printf(”对于引用串序列：”)；for(i=1;i=N;i+)printf(%d,pageingi)；printf(nFIFO算法出现%d次错误。n,ErrorC0);printf(LRU算法出现%d次错误。n,ErrorC1);printf(OPT算法出现%d次错误。n,ErrorC2);
