作业调度程序.doc

作业调度程序 #define N 20 #define M 1000000 #define NULL 0 #includestdio.h typedef struct qNode { int name; float arrive; float runtime; float response; struct qNode *next; }qNode,*linkPtr; typedef struct linkQueue /*定义队列*/ { linkPtr front; linkPtr rear; }linkQueue; initQueue(linkQueue *q) { (*q).front=(*q).rear=(linkPtr)malloc(sizeof(qNode)); if(!(*q).front) { printf(creat fail!\n); exit(); } (*q).rear-next=NULL; } createWork(linkQueue *work) /*按输入创建工作队列*/ { qNode p; qNode *ptr; int i,n; char get=1; ptr=(*work).rear; printf(how many work do you want to do:\n); scanf(%d,n); printf(input the work as:name arrive-time runtime,as: 6 8.9 3.1\n); /*printf(Press Twice when input the works name,q to quit input\n);*/ for(i=0;in;i++) { ptr=(linkPtr)malloc(sizeof(qNode)); scanf(%d %f %f,p.name,p.arrive,p.runtime); p.next=NULL; *ptr=p; (*work).rear-next=ptr; (*work).rear=ptr; } return n; } prinInf() { printf(input your choice\n); printf(\t1 first come first server\t\t2 shortest job first\n); printf(\t3 shortest surplus_time first\t\t4 high response_ratio next\n); printf(\t0 to quit\n); printf(: ); } printJob(linkPtr ptr) /*打印输入作业*/ { ptr=ptr-next; printf(input work were:\n); while(ptr) { printf(%d %10.3f %10.3f\n,ptr-name,ptr-arrive,ptr-runtime); ptr=ptr-next; } } fcfs(int n,linkPtr avp) /*先来先服务*/ { linkQueue fcfs; linkPtr ptr,tmp; int i; float t,T,Tw,Tt[N][2]; T=Tw=0.0; i=0; initQueue(fcfs); avp=avp-next; while(avp) /*按到达时间排序*/ { ptr=fcfs.front; tmp=(linkPtr)malloc(sizeof(qNode)); while(ptr-next-arrive=avp-arriveptr-next) { ptr=ptr-next; } tmp-name=avp-name; tmp-arrive=avp-arrive; tmp-runtime=avp-runtime; tmp-next=ptr-next; ptr-next=tmp; if(ptr==fcfs.rear) { fcfs.rear=tmp; } avp=avp-next; } ptr=fcfs.front-next; t=ptr-arrive; while(ptr) /*按先来先服务进行相关计算*/ { if(ptr-arrive=t) { t=t+ptr-runtime; Tt[i][0]=t-ptr-arrive; Tt[i][1]=Tt[i][0]/ptr-runtime; ptr=ptr-next; ++i; }