作业调度算法c语言,C语言实现短作业优先调度算法.doc

C语言实现短作业优先调度算法

#include "stdio.h"

struct sjf{

char name[10];

float arrivetime;

float servicetime;

float starttime;

float finishtime;

float zztime;

float dqzztime;

float cckj;

float yxtime;

};

sjf a[100];

void input(sjf *p,int N)

{

int i;

printf("输入作业名 & 到达时间 &服务时间 &存储空间:\n 例如: a 0 100 33\n");

for(i=0;i<=N-1;i++)

{

printf("输入第 %d作业信息:\n",i+1);

scanf("%s%f%f%f",&p[i].name,&p[i].arrivetime,&p[i].servicetime,&p[i].cckj);

}

}

void Print(sjf *p,float arrivetime,float servicetime,float starttime,float finishtime,float zztime,float dqzztime,float cckj,int N)

{

int k;

printf("作业执行顺序:");

printf("%s",p[0].name);

for(k=1;k

{

printf("-->%s",p[k].name);

}

printf("\n作业信息:\n");

printf("\nname\t arrive\t service\t start\t finish\t zz\t dqzz\t cckj\t ddsj\t yxtime\n");

for(k=0;k<=N-1;k++)

{

printf("%s\t %-.2f\t %-.2f\t %-.2f\t %-.2f\t %-.2f\t %-.2f\t %-.2f\t %-.2f\t %-.2f\n",p[k].name,p[k].arrivetime,p[k].servicetime,p[k].starttime,p[k].finishtime,p[k].zztime,p[k].dqzztime,p[k].cckj,p[k].finishtime-p[k].servicetime,p[k].servicetime);

}

}

//pai xu

void sort(sjf *p,int N)

{

for(int i=0;i<=N-1;i++)

for(int j=0;j<=i;j++)

if(p[i].arrivetime

{

sjf temp;

temp=p[i];

p[i]=p[j];

p[j]=temp;

}

}

//yun xing jieduan

void deal(sjf *p, float arrivetime,float servicetime,float starttime,float finishtime,float &zztime,float &dqzztime,float cckj,int N)

{

int k;

for(k=0;k<=N-1;k++)

{

if(k==0)

{

p[k].starttime=p[k].arrivetime;

p[k].finishtime=p[k].arrivetime+p[k].servicetime;}

else

{

p[k].starttime=p[k-1].finishtime;

p[k].finishtime=p[k-1].finishtime+p[k].servicetime;}

}

for(k=0;k<=N-1;k++)

{

p[k].zztime=p[k].finishtime-p[k].arrivetime;

p[k].dqzztime=p[k].zztime/p[k].servicetime;

}

}

void sjff(sjf *p,int N)

{

float arrivetime=0,servicetime=0,starttime=0,finishtime=0,zztime=0,dqzztime=0,cckj=0;

sort(p,N);

for(int m=0;m

{

if(m==0)

p[m].finishtime=p[m].arrivetime+p[