先来先服务调度算法和短作业优先调度算法(共8页)

1、精选优质文档-倾情为你奉上先来先服务调度算法和短作业优先调度算法#include <stdio.h>struct fcfs/定义进程的结构体char name10;/进程名float arrivetime;/到达时间float servicetime;/服务时间float starttime;/开始时间float finishtime;/完成时间float zztime;/周转时间float dqzztime;/带权周转时间;struct sjf/定义进程的结构体char name10;/进程名float arrivetime;/到达时间float servicetime;/服务时

2、间float starttime;/开始时间float finishtime;/完成时间float zztime;/周转时间float dqzztime;/带权周转时间;fcfs a100;/定义先来先服务算法进程的最大数量sjf b100;/定义短作业优先算法进程的最大数量void Finput(fcfs *p,int N)/输入函数 int i;printf("intput the process's name & arrivetime & servicetime:nfor exmple: a 0 100n");for(i=0;i<=N-1

3、;i+)printf("input the %dth process's information:n",i+1);scanf("%s%f%f",&,&pi.arrivetime,&pi.servicetime);/输出函数void FPrint(fcfs *p,float arrivetime,float servicetime,float starttime,float finishtime,float zztime,float dqzztime,int N)int k;printf("nrun

4、order:n");printf("%s",);for(k=1;k<N;k+)printf("->%s",);printf("nnthe process's information:n");printf("nnametarrivetservicetstarttfinishtzztdqzznn");for(k=0;k<=N-1;k+) printf("%st%-.2ft%-.2ft%-.2ft%-.2ft%-.2ft%-.2ftnn"

5、,,pk.arrivetime,pk.servicetime,pk.starttime,pk.finishtime,pk.zztime,pk.dqzztime);void Fsort(fcfs *p,int N) /按到达时间排序，先到达排在前面for(int i=0;i<=N-1;i+)for(int j=0;j<=i;j+)if(pi.arrivetime<pj.arrivetime)fcfs temp;temp=pi;pi=pj;pj=temp;/运行结果void Fdeal(fcfs *p, float arrivetime,float servicet

6、ime,float starttime,float finishtime,float &zztime,float &dqzztime,int N) int k;for(k=0;k<=N-1;k+)if(k=0) pk.starttime=pk.arrivetime;pk.finishtime=pk.arrivetime+pk.servicetime;elsepk.starttime=pk-1.finishtime;/开始时间=前一个进程的完成时间pk.finishtime=pk-1.finishtime+pk.servicetime;/结束时间=前一个进程的完成时间+现在

7、进程的服务时间for(k=0;k<=N-1;k+)pk.zztime=pk.finishtime-pk.arrivetime;/周转时间=完成时间-到达时间pk.dqzztime=pk.zztime/pk.servicetime;/带权周转时间=周转时间/服务时间/先来先服务void FCFS(fcfs *p,int N)float arrivetime=0,servicetime=0,starttime=0,finishtime=0,zztime=0,dqzztime=0;Fsort(p,N);Fdeal(p,arrivetime,servicetime,starttime,finis

8、htime,zztime,dqzztime,N);FPrint(p,arrivetime,servicetime,starttime,finishtime,zztime,dqzztime,N); void Sinput(sjf *p,int N)/输入函数 int i;printf("intput the process's name & arrivetime & servicetime:nfor exmple: a 0 100nn");for(i=0;i<=N-1;i+)printf("input the %dth process&

9、#39;s information:n",i+1);scanf("%s%f%f",&,&pi.arrivetime,&pi.servicetime);/输出函数void SPrint(sjf *p,float arrivetime,float servicetime,float starttime,float finishtime,float zztime,float dqzztime,int N)int k;printf("nrun order:n");printf("%s",p0.n

10、ame);for(k=1;k<N;k+)printf("->%s",);printf("nnthe process's information:n");printf("nnametarrivetservicetstarttfinishtzztdqzzn");for(k=0;k<=N-1;k+) printf("%st%-.2ft%-.2ft%-.2ft%-.2ft%-.2ft%-.2ftnn",,pk.arrivetime,pk.servicetime,pk.s

11、tarttime,pk.finishtime,pk.zztime,pk.dqzztime);void Ssort(sjf *p,int N) /按短作业优先算法排序for(int i=1;i<=N-1;i+)for(int j=1;j<=i;j+)if(pi.servicetime<pj.servicetime)sjf temp;temp=pi;pi=pj;pj=temp; /运行结果void Sdeal(sjf *p, float arrivetime,float servicetime,float starttime,float finishtime,float &

12、;zztime,float &dqzztime,int N) int k;for(k=0;k<=N-1;k+)if(k=0) pk.starttime=pk.arrivetime;pk.finishtime=pk.arrivetime+pk.servicetime;elsepk.starttime=pk-1.finishtime;/开始时间=前一个进程的完成时间pk.finishtime=pk-1.finishtime+pk.servicetime;/结束时间=前一个进程的完成时间+现在进程的服务时间for(k=0;k<=N-1;k+)pk.zztime=pk.finish

13、time-pk.arrivetime;/周转时间=完成时间-到达时间pk.dqzztime=pk.zztime/pk.servicetime;/带权周转时间=周转时间/服务时间void SJF(sjf *p,int N)float arrivetime=0,servicetime=0,starttime=0,finishtime=0,zztime=0,dqzztime=0;Ssort(p,N);Sdeal(p,arrivetime,servicetime,starttime,finishtime,zztime,dqzztime,N);SPrint(p,arrivetime,servicetim

14、e,starttime,finishtime,zztime,dqzztime,N); void main()/主函数 while(1)int n;printf("选择哪种算法？1、先来先服务算法（FCFS） 2、段作业优先算法（SJF）n");scanf("%d",&n);if(n=1) /先来先服务算法（FCFS）int N;printf("-先来先服务调度算法-n");printf("input the process's number:n");scanf("%d",&N);Finput(a,N);FCFS(a,N);if(n=2) /短作业优先算法（SJF）int M;printf("-短作业优先调度算法-n");prin