操作系統(tǒng)全體報告-實驗七

請在以上示例實驗程序中補充―增強二次機會‖等置換算法的模擬程序輸入不同的內(nèi)存頁面串和實存幀數(shù)觀察并分析其頁面置換效果和性能，并將其與LRU和FIFO算CPU:I5-4210/2.6GHz內(nèi)存:4GB硬盤:Ubuntu14.0.4-Linux操作系統(tǒng)gccversion.clock:時鐘置換算法，每次記錄頁數(shù)為1，過一次之后，把頁數(shù)由1置為0，若遇到頁數(shù)為0的頁則置換Eclock:加強的時鐘置換算法，每次記錄頁數(shù)為1，修改數(shù)count數(shù)最少的置換出去。Mfu:最大次數(shù)置換算法，每次完頁面count++,選出count數(shù)最多的置換出去。#include<iostream>#include<iomanip>#include<malloc.h>usingnamespacestd;classReplace{voidInitSpace(char*MethodName)voidReport(void);//報告算法執(zhí)行情況voidFifo(void);voidLru(void);voidClock(void);）置換算法voidEclock(void);//增強二次機會置換算法voidLfu(void);//最不經(jīng)常使用置換算法voidMfu(void);int*ReferencePage;//存放要到的頁int*EliminatePageint*PageFramesintPageNumber;//頁數(shù)intFramber;//實存幀數(shù)intFaultNumber;//失敗頁數(shù)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]==//如果頁已放棧頂，則為不缺頁，報告當(dāng)前for(j=0;j<Framber;j++)if(PageFrames[j]>=0) PageFrames[j]<<"cout<<continue//如果頁還未放棧頂，則為缺頁，缺頁數(shù)加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/