页面置换算法

设计目的：

加深对请求页式存储管理实现原理的理解，掌握页面置换算法.

#include<iostream>
#include<vector>
#include<algorithm>
#include<windows.h>
using namespace std;
void output(vector<int>vb)
{
	cout<<"Queue:";
	for(int i=0;i<vb.size();i++)
		cout<<vb[i]<<" ";
	cout<<endl;
}
void OPT(vector<int>vi,int nBlock)//optimal page replacement
{
	int viLen;
	viLen=vi.size();
	vector<int>vb;
	int i,j,maxDistance,index;
	for(i=0;i<viLen;i++)
	{
		if(vb.size()<nBlock)
		{
			if(find(vb.begin(),vb.end(),vi[i])==vb.end())
				vb.push_back(vi[i]);
		}
		else
		{
			if(find(vb.begin(),vb.end(),vi[i])==vb.end())//whether vi[i] is a member of MB
			{
				for(j=0,maxDistance=-1;j<nBlock;j++)//find maxDistance in memBlock
				{
					int pos=find(vi.begin()+i+1,vi.end(),vb[j])-vi.begin();
					if(pos==vi.size())
					{	
						index=j;
						break;
					}
					else
					{
						if(pos>maxDistance)
						{
							index=j;
							maxDistance=pos;
						}
					}
				}
				vb[index]=vi[i];
			}		
		}
		output(vb);
	}
}
void FIFO(vector<int>vi,int nBlock)
{
	vector<int>vb;
	int i,j,viLen;
	viLen=vi.size();
	for(i=0,j=0;i<viLen;i++)
	{
		if(vb.size()<nBlock)
		{
			if(find(vb.begin(),vb.end(),vi[i])==vb.end())
				vb.push_back(vi[i]);
		}
		else
		{
			if(find(vb.begin(),vb.end(),vi[i])==vb.end())
			{
				vb[j++]=vi[i];
				if(j==nBlock)
					j=0;
			}
		}
		output(vb);
	}
}
void LRU(vector<int>vi,int nBlock)
{
	vector<int>vb;
	int i,j,pos,viLen,maxTime,index;
	viLen=vi.size();
	for(i=0;i<viLen;i++)
	{
		if(vb.size()<nBlock)
		{
			if(find(vb.begin(),vb.end(),vi[i])==vb.end())//if vi[i] isn't exist in vb[]
				vb.push_back(vi[i]);//push
		}
		else
		{
			if(find(vb.begin(),vb.end(),vi[i])==vb.end())
			{
				for(j=0,maxTime=9999;j<nBlock;j++)
				{
					for(pos=i-1;pos>=0;pos--)//find maxDistance in memBlock
						if(vb[j]==vi[pos])
							break;
					if(pos<maxTime)
						index=j,maxTime=pos;
				}
				vb[index]=vi[i];
			}
		}
		output(vb);
	}
}
void showData(vector<int>vi,int nBlock)
{
	cout<<nBlock<<"  Memory Blocks"<<endl;
	cout<<"There is the memory sequence: ";
	for(int i=0;i<vi.size();i++)
		cout<<vi[i]<<" ";
	cout<<endl<<endl;
}
int main()
{
	vector<int>vi;
	int mem,nBlock;
	cout<<"How many blocks?"<<endl;
	cin>>nBlock;
	cout<<"Input the sequence of memory(end up with -1)"<<endl;
	cout<<"e.g: 1 5 3 2 -1"<<endl;
	while(cin>>mem&&mem!=-1)
		vi.push_back(mem);
	system("cls");
	cout<<endl<<endl<<endl<<endl<<"\t\t**********************************************"<<endl;
	cout<<"\t\t*               Selections                   *"<<endl;
	cout<<"\t\t**********************************************"<<endl;
	cout<<"\t\t*      1.OPT(Optimal page replacement)       *"<<endl;
	cout<<"\t\t*      2.FIFO(First In First Out)            *"<<endl;
	cout<<"\t\t*      3.LRU(Least Recently Used)            *"<<endl;
	cout<<"\t\t**********************************************"<<endl<<endl;
	cout<<"Which algorithm you want to choice?"<<endl;
	int n;
	cin>>n;
	system("cls");
	showData(vi,nBlock);
	switch(n)
	{
		case 1:OPT(vi,nBlock);break;
		case 2:FIFO(vi,nBlock);break;
		case 3:LRU(vi,nBlock);break;
		default:cout<<"Wrong input!"<<endl;break;
	}
	return 0;
}