磁盘调度实验C++源代码.doc

操作系统实验：首先在文件目录下建立 hard.txtC+源代码：#include#include#include#include/读入磁道号流 const int MAXQUEUE=200;typedef struct nodeint go;int visited;qu;qu queueMAXQUEUE;int quantity;int start;void initial()int i;for(i=0;iMAXQUEUE;i+) queuei.go=-1; queuei.visited=0; start=53;/磁头的初始位置 void readData() FILE *fp; char fname20; int temp,i; coutfname; if(fp=fopen(fname,r)=NULL) cout错误,文件打不开,请检查文件名:)endl; else while(!feof(fp) fscanf(fp,%d ,&temp); queuequantity.go=temp; quantity+; coutendl-endl; cout所读入的磁道号流:; for(i=0;iquantity;i+) coutqueuei.go ; coutendl请求数为:quantityendl; /FIFO算法 void FIFO() int i; int total=0; int current; coutendl-endl; coutFIFO算法的访问磁道号顺序流:; current=start; for(i=0;iquantity;i+) coutqueuei.go ; total+=abs(queuei.go-current); current=queuei.go; coutendl磁头移过的柱面数:total; /最短寻道优先调度算法 void shortest() int i,j,p; int total=0; int current; coutendl-endl; cout最短寻道优先调度算法的访问磁道号顺序流:; current=start; for(i=0;iquantity;i+) p=0; while(queuep.visited!=0) p+; for(j=p;jabs(current-queuej.go) p=j; coutqueuep.go ; total+=abs(queuep.go-current); queuep.visited=1; current=queuep.go; coutendl磁头移过的柱面数:total; /电梯算法 void elevator() int i,j,p,flag; int total=0; int current; coutendl-endl; cout电梯调度算法endl; /磁头初始向里 cout磁头初始向里的访问磁道号顺序流:; current=start; for(i=0;iquantity;i+) flag=1000; p=-1; for(j=0;j=current) if(abs(queuej.go-current)flag) p=j; flag=abs(queuej.go-current); if(p!=-1) coutqueuep.go ; total+=abs(queuep.go-current); current=queuep.go; queuep.visited=1; else for(j=0;jquantity;j+) if(queuej.visited=0)&(queuej.gocurrent) if(abs(queuej.go-current)flag) p=j; flag=abs(queuej.go-current); coutqueuep.go ; total+=abs(queuep.go-current); current=queuep.go; queuep.visited=1; coutendl磁头移过的柱面数:totalendl; /磁头初始向外 for(i=0;iquantity;i+) queuei.visited=0; total=0; cout磁头初始向外的访问磁道号顺序流:; current=start; for(i=0;iquantity;i+) flag=1000; p=-1; for(j=0;jquantity;j+) if(queuej.visited=0)&(queuej.go=current) if(abs(queuej.go-current)flag) p=j; flag=abs(queuej.go-current); if(p!=-1) coutqueuep.go ; total+=abs(queuep.go-current); current=queuep.go; queuep.visited=1; else for(j=0;jcurrent) if(abs(queuej.go-current)flag) p=j; flag=abs(queuej.go-current); coutqueuep.go ; total+=abs(queuep.go-current); current=queuep.go; queuep.visited=1; coutendl磁头移过的柱面数:total; /显示版权信息函数 void version() coutendlendl; cout endl; cout 磁盘调度算法系统 endl; cout endl; cout (c)All Right Reserved Neo endl; cout endl; cout version 2004 build 1122endl; cout endl; coutendlend