fifo.txt

操作系统页面置换 调度 寻道程序 简短使用

#include <iostream.h>
#include <stdlib.h>
#define RAND_MAX 0x7fff;
#include   <time.h>
void main()
{
	int in,out,request,place;
	int count=0;
	cout<<"请输入页面的数目:"<<endl;
	cin>>in;
	cout<<"请输入请求的数目:"<<endl;
	cin>>request;
	cout<<"请输入现有的空间:"<<endl;
	cin>>place;
	int y=place;
	int store[100];
	srand( (unsigned)time( NULL ) );
	cout<<"现有的请求为:"<<endl;
	for(int j=0;j<request;j++)
	{
			out=rand()*(in-0)/RAND_MAX+0;
		    cout<<out<<"\t";
		    store[j]=out;
	}
	cout<<endl;
    int *p=new int[place];
	for(int z=0;z<place;z++)
	{
		p[z]=-1;
	}
	cout<<"输出序列为:"<<endl;
	int x,q;
	int d=0;
	for(int i=0;i<request;i++)
	{ 
A:			if(p[place-1]!=store[i])   
			{		
			 place--;
			 q=store[i];	
			 if(place==0)
			 {   
				 for(int j=0;j<y-1;j++)
				 {   
					 p[place]=p[place+1]; 
					 place++;
				 }
				 	p[place]=q;
					place=y;
				for(int x=0;x<y;x++)
				{       
						cout<<"p["<<x<<"]="<<p[x]<<"\t";
				}
	             	
					cout<<endl;	  
			}
			else
			{
				goto A;
			}
			}
		     else
	    	{
			cout<<"不缺页中断"<<endl;
			count++;
			place=y;
			}	
	}
	cout<<endl;
	cout<<"不缺页中断数为:"<<count<<endl;
}