浙江理工大學(xué)操作系統(tǒng)實(shí)驗(yàn)三頁(yè)面置換算法

1、操作系統(tǒng)實(shí)驗(yàn)報(bào)告班級(jí)：計(jì)算機(jī)科學(xué)與技術(shù)三班 姓名：李生啟 學(xué)號(hào)：2013329620077實(shí)驗(yàn)三：頁(yè)面置換算法一、 實(shí)驗(yàn)?zāi)康?、熟悉內(nèi)存分頁(yè)管理策略。 2、編寫(xiě)OPT、FIFO、LRU，LFU四種置換算法并模擬實(shí)現(xiàn)。3、鍛煉知識(shí)的運(yùn)用能力和實(shí)踐能力。二、 實(shí)驗(yàn)內(nèi)容設(shè)計(jì)主界面，輸入一串系列模擬頁(yè)面請(qǐng)求，實(shí)現(xiàn)以下算法： 1) 最佳置換算法(OPT)：將以后永不使用的或許是在最長(zhǎng)(未來(lái))時(shí)間內(nèi)不再 被訪問(wèn)的頁(yè)面換出。 2) 先進(jìn)先出算法(FIFO)：淘汰最先進(jìn)入內(nèi)存的頁(yè)面，即選擇在內(nèi)存中駐留 時(shí)間最久的頁(yè)面予以淘汰。 3) 最近最久未使用算法(LRU)：淘汰最近最久未被使用的頁(yè)面。 4) 最不經(jīng)常使

2、用算法(LFU)三、 代碼及運(yùn)行結(jié)果分析1.代碼：（采用C+，環(huán)境：VS2010）#include<iostream>#include<string>#include <fstream>#include<stdio.h>using namespace std;void OPT(int count)int all50;int bracket3;int bll50=0;ifstream fin("abc.txt");if( fin.is_open() ) for(int i=0;i<count;i+)fin>>a

3、lli;fin.close();bracket0=all0;bracket1=all1;bracket2=all2;for(int i=0;i<count;i+)if(i<3) if(i=0) cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<endl; if(i=1) cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<bracket1<<endl;

4、if(i=2) cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<bracket1<<" "<<bracket2<<endl; if(i>=3)int a_num=count+1;int b_num=count+1;int c_num=count+1;int qi=0;for(int x=0;x<3;x+)if(bracketx=alli)cout<<"當(dāng)前序列："

5、<<endl;cout<<bracket0<<" "<<bracket1<<" "<<bracket2<<endl;qi=6; break;if(qi=0)for(int e=i+1;e<count;e+)if(bracket0=alle)a_num=e;break;for(int e=i+1;e<count;e+)if(bracket1=alle)b_num=e;break;for(int e=i+1;e<count;e+)if(bracket2=al

6、le)c_num=e;break;if(a_num>=b_num)&&(a_num>=c_num)bracket0=alli;else if(b_num>=a_num)&&(b_num>=c_num)bracket1=alli;else if(c_num>=b_num)&&(c_num>=a_num)bracket2=alli;cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<br

7、acket1<<" "<<bracket2<<endl;void FIFO(int count)int bll50=0;int all50;int top=0;ifstream fin("abc.txt");if( fin.is_open() ) for(int i=0;i<count;i+)fin>>alli;fin.close();for(int i=0;i<count;i+)if(top<3)blltop=alli; top+; if(top=1) cout<<"

8、;當(dāng)前序列："<<endl;cout<<blltop-1<<endl; if(top=2) cout<<"當(dāng)前序列："<<endl;cout<<blltop-1<<" "<<blltop-2<<endl; if(top=3) cout<<"當(dāng)前序列："<<endl;cout<<blltop-1<<" "<<blltop-2<<&

9、quot; "<<blltop-3<<endl; if(top>=3)if(alli!=blltop-1)&&(alli!=blltop-2)&&(alli!=blltop-3)blltop=alli;top+;cout<<"當(dāng)前序列："<<endl;cout<<blltop-1<<" "<<blltop-2<<" "<<blltop-3<<endl;void LRU(

10、int count)int bll50=0;int all50;int top=0;ifstream fin("abc.txt");if( fin.is_open() ) for(int i=0;i<count;i+)fin>>alli;fin.close();for(int i=0;i<count;i+)if(top<3)blltop=alli; top+; if(top=1) cout<<"當(dāng)前序列："<<endl;cout<<blltop-1<<endl; if(top=

11、2) cout<<"當(dāng)前序列："<<endl;cout<<blltop-1<<" "<<blltop-2<<endl; if(top=3) cout<<"當(dāng)前序列："<<endl;cout<<blltop-1<<" "<<blltop-2<<" "<<blltop-3<<endl; if(top>=3)int end3;in

12、t point=0;blltop=alli;top+;end0=blltop-1;point+;for(int i=top-2;i>=0;i-)if(point=3)cout<<"當(dāng)前序列："<<endl; cout<<end0<<" "<<end1<<" "<<end2<<endl;point=0;break; else if(point=1)&&(end0!=blli)endpoint=blli;point+;el

13、se if(point=2)&&(end0!=blli)&&(end1!=blli)endpoint=blli;point+;void LFU(int count)int all50;int bll50=0;int top=0;int bracket3;ifstream fin("abc.txt");if( fin.is_open() ) for(int i=0;i<count;i+)fin>>alli;fin.close(); bracket0=all0;bracket1=all1;bracket2=all2;for(in

14、t i=0;i<count;i+)int a_num=0;int b_num=0;int c_num=0;int qi=0;if(i<3) if(i=0) cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<endl; if(i=1) cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<bracket1<<endl; if(i=2) cout<<

15、;"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<bracket1<<" "<<bracket2<<endl; if(i>=3)for(int x=0;x<3;x+)if(bracketx=alli)cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<bracket1<<&quo

16、t; "<<bracket2<<endl;qi=6; break;if(qi=0)for(int e=0;e<=i;e+)if(bracket0=alle)a_num+;for(int e=0;e<=i;e+)if(bracket1=alle)b_num+;for(int e=0;e<=i;e+)if(bracket2=alle)c_num+;if(a_num<=b_num)&&(a_num<=c_num)bracket0=alli;else if(b_num<=a_num)&&(b_num&

17、lt;=c_num)bracket1=alli;else if(c_num<=b_num)&&(c_num<=a_num)bracket2=alli;cout<<"當(dāng)前序列："<<endl;cout<<bracket0<<" "<<bracket1<<" "<<bracket2<<endl;int main()int a50;int count=0;cout<<"請(qǐng)輸入頁(yè)面請(qǐng)求序列的個(gè)數(shù)：&

18、quot;<<endl;cin>>count;ofstream out("abc.txt");cout<<"請(qǐng)輸入頁(yè)面請(qǐng)求序列："<<endl;if(out.is_open()for(int i=0;i<count;i+) cin>>ai; out << ai<< endl; out.close( );while(true)int choose;cout<<"-"<<endl; cout<<"最佳置換

19、算法(OPT)-1"<<endl; cout<<"先進(jìn)先出算法(FIFO)-2"<<endl; cout<<"最近最久未使用算法(LRU)-3"<<endl; cout<<"最不經(jīng)常使用算法(LFU)-4"<<endl; cout<<"退出系統(tǒng)-5"<<endl; cout<<"-"<<endl; cout<<"輸入要執(zhí)行的操作；"<<endl; cin>>choose; switch(choose) case 1:OPT(count);break; case 2