磁道调度算法

1、001 for(i=0;iMAXQUEUE;i+)002 queuei.go=-1;003 queuei.visited=0;004 )005006 start=53;/磁头的初始位置007 )008/读入磁道号009、流010 void readData()011 (012 FILE *fp;013 char fname20;014 int temp,i;015016 coutfname;019020 if(fp=fopen(fname,r)=NULL)(021 cout错误，文件打不开,请检查文件名:)endl;022 )023 else(024 while(!feof(fp)(025 f

2、scanf(fp,%d ，&temp);026 queuequantity.go=temp;027 quantity+;028 )endl02 coutendl9030 cout所读入的磁道号流：；031 for(i=0;iquantity;i+)(032 coutqueuei.go”;033 034 coutendl请求数为：quantityendl;035 036 037038 /FIFO 算法039 void FIFO()040 (041 int i;042 int total=0;043 int current;04404 coutendlendl5;04cout FIFO算法的访问磁

3、道号顺序流：；6047048 current二start;049 for(i=0;iquantity;i+)050 coutqueuei.go”;051 total+=abs(queuei.go-current);052 current二queuei.go;053 054 coutendl磁头移过的柱面数：total;055 056 057 /最短寻道优先调度算法058 void shortest()059 (060 int i,j,p;061 int total=0;062 int current;06306 coutendlendl4065 cout最短寻道优先调度算法的访问磁道号顺序流:

4、;066 067 current二start;068 for(i=0;iquantity;i+)069 p=0;070while(queuep.visited!=0)071 p+;072 )073 for(j=p;jabs(current-qu4 euej.go)075 p=j;076 077 078 coutqueuep.go”;079 total+=abs(queuep.go-current);080 queuep.visited=1;081 current二queuep.go;082 083 coutendl磁头移过的柱面数：total;084 085086 /电梯算法087 void

5、elevator()088 (089 int i,j,p,flag;090 int total=0;091 int current;092endl09 coutendl 3;094 cout电梯调度算法endl;095096 /磁头初始向里097 cout磁头初始向里的访问磁道号顺序流:;098099 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);110if(p!=-1)coutqu

6、euep.go”;total+=abs(queuep.go-current);current二queuep.go;queuep.visited=1;116else(for(j=0;jquantity;j+)(if(queuej.visited=0)&(queuej.gocurrent)if(abs(queuej.go-current)flag)p=j;flag=abs(queuej.go-current);124coutqueuep.go”;total+=abs(queuep.go-current);current=queuep.go;queuep.visited=1;130coutendl磁

7、头移过的柱面数:totalendl;134/磁头初始向外for(i=0;iquantity;i+)queuei.visited=0;total=0;139140 cout磁头初始向外的访问磁道号顺序流:；141current二start;for(i=0;iquantity;i+)(144flag=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);152if(p!=-1)coutq

8、ueuep.go”;total+=abs(queuep.go-current);current=queuep.go;queuep.visited=1;159else(for(j=0;jcurrent)if(abs(queuej.go-current)flag)p=j;flag=abs(queuej.go-current);166167 168coutqueuep.go”;total+=abs(queuep.go-current);current二queuep.go;queuep.visited=1;174)175 coutendl磁头移过的柱面数：total;176177 178显示版权信息函数void version()(coutendlendl;1831cout |磁盘调度算法系统1|cout111cout |(c)All Right Reserved Neo1cout | HYPERLINK mailto: |endl;cout |version 2004 build 1122cout11185186187188189190endl;endl;endl;|endl;184cout|endl;endl;191coutendlendl; 194 195void main()(int i;199200