存储管理流程图及其代码.doc

提示出错，重新输入NYYN结 束是否用其他算法继续S=? Msize加1Msize32 用户内存空间msize=2形成地址页号1S4输入算法号S生成地址流开 始 OPTFIFO12实验程序产生指令流文件produce_addstream.h#ifndef PRODUCE_ADDSTREAM_H#define PRODUCE_ADDSTREAM_H#include#include#include#include#include using namespace std;#define random(x) (rand()%x)#define MAX_LENGTH 320struct produceint num; /指令序号int zhiling; /指令地址int virtualpage; /指令虚页号produce *next;struct produce*creatlist();void insert(struct produce *first,struct produce *s); /插入一个节点（尾插法）void print(struct produce *first); /打印函数int max(vectorvector ,int );struct produce*creatlist()srand(int)time(0);struct produce*first=new produce;first-next=NULL;int m=0,m1=0;/*int yanzheng20=7,0,1,2,0,3,0,4,2,3,0,3,2,1,2,0,1,7,0,1;for (int i=0;inum=i*4+0;s0-zhiling=yanzhengi*4+0;s0-virtualpage=s0-zhiling;insert(first,s0);struct produce *s1;s1=new produce;s1-num=i*4+1;s1-zhiling=yanzhengi*4+1;s1-virtualpage=s1-zhiling;insert(first,s1);struct produce *s2;s2=new produce;s2-num=i*4+2;s2-zhiling=yanzhengi*4+2;s2-virtualpage=s2-zhiling;insert(first,s2);struct produce *s3;s3=new produce;s3-num=i*4+3;s3-zhiling=yanzhengi*4+3;s3-virtualpage=s3-zhiling;insert(first,s3);/*/*for (int i=0;inum=i*4+0;s0-zhiling=m+1;s0-virtualpage=s0-zhiling/10;insert(first,s0);m1=random(m+1);struct produce *s1;s1=new produce;s1-num=i*4+1;s1-zhiling=m1;s1-virtualpage=s1-zhiling/10;insert(first,s1);struct produce *s2;s2=new produce;s2-num=i*4+2;s2-zhiling=m1+1;s2-virtualpage=s2-zhiling/10;insert(first,s2);struct produce *s3;s3=new produce;s3-num=i*4+3;s3-zhiling=random(MAX_LENGTH-m1-2)+m1+2;s3-virtualpage=s3-zhiling/10;insert(first,s3);/*/return first;void insert(struct produce *first,struct produce *s)struct produce *r=first;struct produce *p;while(r)p=r;r=r-next;p-next=s;p=s;p-next=NULL;void print(struct produce *first) /打印函数struct produce *p;p =first-next;cout随机产生的指令的信息如下endl;cout指令序号 指令地址 指令虚页号endl;while (p)coutnumtzhilingsetw(14)virtualpagenext;int max(vectorvector page,int Maxpage)int a=0,position=0;for (int i=0;ia)a=pagei1;position=i;return position;#endif先来先出调度算法：fifo.h#ifndef FIFO_H#define FIFO_Hvoid fifo(struct produce *first,int Maxpage)vector page(Maxpage);/for (int i=0;inext;while (p)pages=p-virtualpage;for(int i=0;iMaxpage;i+)if (pagei=-1|count1next;coutFIFO调度算法缺页次数 缺页率 命中率endl;coutcount2setw(25)double(count2)/MAX_LENGTHsetw(10)1-double(count2)/MAX_LENGTHendl;#endif FIFO_HLRU调度算法lru.h#ifndef LRU_H#define LRU_H#includeusing namespace std;/int max(vectorvector ,int );void lru(struct produce*first,int Maxpage)struct produce*p=first-next;vectorvector page2(Maxpage, vector(2); int count1=0; /定义内存已经被占用的页数int count2=0; /定义记录缺页次数int equal=0; /定义判断如果当前页数与比较的页数，如果相等则为1，否则为0int place=0; /定义要替换的位置for (int i=0;iMaxpage;i+)page2i0=-1;page2i1=0;while (p)if (count1Maxpage)for (int i=0;ivirtualpage;count2+;break;else if (page2i0=p-virtualpage)page2i1 =1;count1+;elsefor (int i=0;ivirtualpage)equal=1;place=i;break;if (equal=1)page2place1 =1;equal=0;else place = max(page2,Maxpage);page2place1=1;page2place0=p-virtualpage;count2+;p=p-next;coutLRU调度算法缺页次数 缺页率 命中率endl;coutcount2setw(24)double(count2)/MAX_LENGTHsetw(10)1-double(count2)/MAX_LENGTHendl;#endif LRU_HOPT调度算法opt.h#ifndef OPT_H#define OPT_H#includeusing namespace std;int search(struct produce*place,int position);void opt(struct produce*first,int Maxpage)struct produce*p =first-next;vectorvector page3(Maxpage, vector(2);int count1=0; /定义内存已被使用的页数int count2=0; /定义缺页次数int current=0; /定义当前工作位置int equal=0; /定义判断如果当前页数与比较的页数，如果相等则为1，否则为0int place=0; /定义要替换的位置for (int i=0;iMaxpage;i+)page3i0=-1;page3i1=0;while (p)/cout1111endl;if (count1Maxpage)for (int i=0;ivirtualpage;page3i1=search(p,current);count2+;break;else if (page3i0=p-virtualpage)page3i1=search(p,current);count1+;elsefor (int i=0;ivirtualpage)equal=1;place=i;break;if (equal=1)page3place1 =search(p,current);equal=0;elseplace = max(page3,Maxpage);page3place1=search(p,current);page3place0=p-virtualpage;count2 +=1;p=p-next;current +=1;coutOPT调度算法缺页次数 缺页率 命中率endl;coutcount2setw(25)double(count2)/MAX_LENGTHsetw(10)1-double(count2)/MAX_LENGTHnext;int current=place-virtualpage;int position1=position+1;while(p)if (current=p-virtualpage)return position1;position1+;p=p-next;return position1;#endif主函数 控制台ccglmain.cpp#include#include produce_addstream.h#include fifo.h#include lru.h#include opt.hvoid main()int S; /定义变量记录用户选择char again; /定义变量用户选择继续还是退出cout开始产生内存指令endl;struct produce *first=creatlist();/产生随机指令cout打印产生的指令信息endl;print(first);/打印产生的指令信息while (1)int Maxpage=3;/定义内存最大页面数cout输入你的选择endl;cout1:FIFO(先进先出)调度算法n2:LRU(最近最少使用算法)n3:OPT(最佳淘汰算法)n4:清屏S;while(S4|S1)cout输入错误重新输入S;if (S