动态页式存储管理模拟实现C语言

1、作者：ZHANGJIAN 仅供个人学习，勿做商业用途在内存划出一块区域，并进行页面划分；设计请求页表；模拟页面分配；分别模拟“先进先出页面淘汰算法FIFO”、“最近最少使用页面淘汰算法LRU”和“理想型淘汰算法OPT”本程序随机产生请求序列，分别模拟FIFO,LRU,OPT三种算法。将结果保存在FIFO.txt,LRU.txt,OPT.txt三个文件中。程序代码：#include#include#include#define N 20#define P 3struct DuLNodeint data;struct DuLNode *prior;struct DuLNode *next;int

2、pageFIFON+1;int front=0,rear=0;int pageingN+1,pmemP+1;int memcount=1;void init(int a,int T)int i;for(i=0;i=T;i+)ai=-2;int insert_item(int item,int queue,int T)if(rear+1)%(T+1)=front)return 1;queuerear=item;rear=(rear+1)%(T+1);return 0;int remove_item(int *item,int queue,int T)if(front = rear)return

3、1;*item=queuefront;front=(front+1) % (T+1);return 0;int findif(int a,int b,int T)int i;for(i=1;i=T;i+)if(ai=b)return i;return -1;void insertintomem(int a,int b,int n)if(memcount=P)amemcount=b;memcount+;elsean=b;void initpage(int page)int temp,i;srand(unsigned)time(0);for(i=1;idata=e;add-prior=p-prio

4、r;p-prior-next=add;add-next=p;p-prior=add;int getI(struct DuLNode *p,int e)int i;struct DuLNode *cd=p;for(i=1;i+)cd=cd-next;if(cd-data=e)return i;if(cd=p)return -1;void deleLink(struct DuLNode *p,int i,int *e)int n;struct DuLNode *cd=p;for(n=1;nnext;*e=cd-data;cd-prior-next=cd-next;cd-next-prior=cd-

5、prior;free(cd);void removebottom(struct DuLNode *p,int *e)struct DuLNode *cd=p-next;*e=cd-data;cd-next-prior=p;p-next=cd-next;free(cd);int getcount(int a,int b,int n,int T)int i;for(i=n;i=T;i+)if(ai=b)return (i-n); return -1;void getreplacepage(int a,int b,int i,int *e)int t,cP+1,temp,T,count=0,erro

6、rP+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;for(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)=

7、NULL)printf(不能打开文件！n);exit(1);for(i=1;i=N;i+)fprintf(fp1, %d ,pageingi);fprintf(fp1,n);for(i=1;iP&findif(pmem,pageingi,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,+er

8、ror);精品文档收集整理汇总elseif(memcount出现第 %d 次错误！n,pageingi,+error);精品文档收集整理汇总elsefprintf(fp1,%d已在页中-未出现错误。n,pageingi);fclose(fp1);ErrorC0=error;memcount=1;error=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(pm

9、em,pageingi,P)=-1)removebottom(p,&temp);insertintomem(pmem,pageingi,findif(pmem,temp,P);精品文档收集整理汇总if(getI(p,pageingi)!=-1)deleLink(p,getI(p,pageingi),&temp1);addtoLink(p,pageingi);fprintf(fp2,%d被引用，%d被替换-出现第 %d 次错误！n,pageingi,temp,+error);精品文档收集整理汇总elseif(memcount出现第 %d 次错误！n,p-prior-data,+error);精品

10、文档收集整理汇总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)=NULL)printf(不能打开文件！n);exit(1);for(i=1;i=N;i+)fprintf(fp3, %d ,pageingi);fprintf(fp3,n);for(i=1;iP&findif(pmem,p

11、ageingi,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(对于引用串

12、序列：);for(i=1;i=N;i+)printf( %d ,pageingi);printf(nFIFO算法出现 %d 次错误。n,ErrorC0);printf(LRU算法出现 %d 次错误。n,ErrorC1);printf(OPT算法出现 %d 次错误。n,ErrorC2);版权申明本文部分内容，包括文字、图片、以及设计等在网上搜集整理。版权为张俭个人所有This article includes some parts, including text, pictures, and design. Copyright is Zhang Jians personal ownership.

13、用户可将本文的内容或服务用于个人学习、研究或欣赏，以及其他非商业性或非盈利性用途，但同时应遵守著作权法及其他相关法律的规定，不得侵犯本网站及相关权利人的合法权利。除此以外，将本文任何内容或服务用于其他用途时，须征得本人及相关权利人的书面许可，并支付报酬。Users may use the contents or services of this article for personal study, research or appreciation, and other non-commercial or non-profit purposes, but at the same time, t

14、hey shall abide by the provisions of copyright law and other relevant laws, and shall not infringe upon the legitimate rights of this website and its relevant obligees. In addition, when any content or service of this article is used for other purposes, written permission and remuneration shall be obtained from the person concerned and the relevant obligee.转载或引用本文内容必须是以新闻性或资料性公共免费信息为使用目的的合理、善意引用，不得对本文内容原意进行曲解、修改，并自负版权等法律责任。Reproduction or quotation of the content of this article must be reas