操作系统全体报告-实验七

请在以上示例实验程序中补充―增强二次机会‖等置换算法的模拟程序输入不同的内存页面串和实存帧数观察并分析其页面置换效果和性能，并将其与LRU和FIFO算CPU:I5-4210/2.6GHz内存:4GB硬盘:Ubuntu14.0.4-Linux操作系统gccversion.clock:时钟置换算法，每次记录页数为1，过一次之后，把页数由1置为0，若遇到页数为0的页则置换Eclock:加强的时钟置换算法，每次记录页数为1，修改数count数最少的置换出去。Mfu:最大次数置换算法，每次完页面count++,选出count数最多的置换出去。#include<iostream>#include<iomanip>#include<malloc.h>usingnamespacestd;classReplace{voidInitSpace(char*MethodName)voidReport(void);//报告算法执行情况voidFifo(void);voidLru(void);voidClock(void);）置换算法voidEclock(void);//增强二次机会置换算法voidLfu(void);//最不经常使用置换算法voidMfu(void);int*ReferencePage;//存放要到的页int*EliminatePageint*PageFramesintPageNumber;//页数intFramber;//实存帧数intFaultNumber;//失败页数int*Referencebit;int*int*#include"vmrp.h"intcout<<"Pleaseinputpagenumbers:";cin>>PageNumber;ReferencePage=newint[sizeof(int)*PageNumber];EliminatePage=newint[sizeof(int)*PageNumber];cout<<"Pleaseinputreferencepagestring:";for(i=0;i<PageNumber;i++)cin>>ReferencePage[i];cout<<"Pleaseinputpageframes:";cin>>Framber;PageFrames=newint[sizeof(int)*Framber];Referencebit=newint[sizeof(int)*Framber];count=newint[sizeof(int)*Framber];Modifybit=newint[sizeof(int)*Fra}}voidReplace::InitSpace(char*MethodName){inti;cout<<endl<<MethodName<<endl;//还未开始,-1表示无for(i=0;i<PageNumber;i++)EliminatePage[i]=-1;for(i=0;i<Framber;i++){PageFrames[i]=-1;}}voidcout<<endl<<"Eliminatefor(inti=0;EliminatePage[i]!=-1;i++)cout<<EliminatePage[i]<<"";cout<<endl<<"Numberofpagefaults=<<FaultNumber<<cout<<setw(6)<<setprecision(3)cout<<"Rateofpagefaults="<< }voidReplace::Lru(void){inti,j,k,l,next;for(k=0,l=0;k<PageNumber;k++){for(i=0;i<Framber;i++){if(next==PageFrames[i]){next=for(j=i;j>0;j--) PageFrames[j] PageFrames[j-1];}}

if(PageFrames[0]==//如果页已放栈顶，则为不缺页，报告当前for(j=0;j<Framber;j++)if(PageFrames[j]>=0) PageFrames[j]<<"cout<<continue//如果页还未放栈顶，则为缺页，缺页数加1 for(j=Framber-1;j>0;j--)PageFrames[j]=PageFrames[j-1];for(j=0;j<Framber;if(PageFrames[j]>=0)cout<<PageFrames[<<"cout<<"->"<<EliminatePage[l++]<<endl;cout<<}}voidReplace::Fifo(void){inti,j,k,l,next;for(k=0,j=l=0;k<PageNumber;k++){for(i=0;i<Framber;i++)if(i<Fra PageFrames[i]<<"";cout<<endl;}PageFrames[j]=next;j=(j+1)%Frafor(i=0;i<Framber;i++) PageFrames[i]<<"cout<<"->"<<EliminatePage[l++]<<endl;cout<<}}voidintj,i,k,l,next;for(k=0,j=l=0;k<PageNumber;k++){for(i=0;i<Framber;i++)}if(i<Frafor(i=0;i<Framber;i++)cout<<PageFrames[i]<<"";cout<<endl;}}PageFrames[j]=next;Referencebit[j]=1;for(i=0;i<Framber;i++) PageFrames[i]<<"cout<<"->"<<EliminatePage[l++]

cout<<}}voidReplace::Eclock(void){intj,i,k,l,next;for(k=0,j=l=0;k<PageNumber;k++){for(i=0;i<Framber;i++)}if(i<Frafor(i=0;i<Framber;i++)<<PageFrames[i]<<"cout<<endl;}if(Referencebit[j]==1){}if(Modifybit[j]==1){Modifybit[j]=0;}intfor(i=0;mber;for(i=0;mber;}} PageFrames[i]<<"";cout<<"->"<<<<

cout<<}}voidReplace::Lfu(void){intj,i,k,l,next;for(k=0,j=l=0;k<PageNumber;k++){}if(i<Fra cout<<PageFrames[i]<<"";cout<<endl;}intmin=count[0];intindex=0;}}<<"

for(i=0;i<Framber;i++)if(PageFrames[i]>=0)cout<<PageFrames[i]cout<<"->"<<<<}

cout<<}void{intfor(k=0,j=l=0;k<PageNumber;k++){for(i=0;i<Framber;i++)}if(i<Fra PageFrames[i]<<"";cout<<endl;}intmax=count[0];intindex=0;}}<<"

for(i=0;i<Framber;i++)if(PageFrames[i]>=0)cout<<PageFrames[i]cout<<"->"<<<<}

/r/