进程调度算法实验

《进程调度算法实验》由会员上传分享，免费在线阅读，更多相关内容在工程资料-天天文库。

1、#defineMAX5#includc#includeinttotal_time=20;inttime_slice=3;typedefstnictprocess{//进程控制块charpname[10J;intWaitTime;intBurstTime;intpriority;//数字越小优先级越高structprocess*next;}PROCESS;//typedefstructprocessPROCESS;PROCESS*in_queue(PROCESS*head,PROCESS*p);/

2、/声明PROCESS*init()//进程初始化{inti=0;chara;PROCESS*head_new;//队列的队头head_new=(structprocess*)malloc(sizeof(structprocess));if(!head_new)exit(l);hcad_ncw=NULL;do{structprocess*s;printf(Hinitializetheprocess:H);s=(structprocess*)malloc(sizeof(structprocess));if(!s)exit(l);pr

3、intf(Mpleaseinputthepname:WaitTime:BurstTime:priority:n);scanf(f,%cH，&(s->pname));scanf("%d",&(s->WaitTime));scanf("%dM,&(s->BurstTime));scanf(H%d",&(s->priority));s->next=NULL;in_qucuc(hcad_ncw,s);i++；printf("douwanttoinsertprocessmore??'Y'or'N'n”)；printf(”W);scanf(

4、”％c",&a);scanf(”％c”,&a);//if(a==,Y,lla==y)continue;//elseif(a==,N,lla==,n,)break;}while((inext=NUL

5、L;}else{p->next=head;head=p;}//printf("thcprocessinsertintothemothballqueue:M);returnhead;}lllllllllllllllllllllllllllllllllllllllllllllllllllllllllllll/*voidnew_queue()//后备队列先來先服务方式进入就绪{return*hcad_ncw;}*/PROCESS*FCFS_process(){PROCESS*p,*q,*a;//a用來记录选中结点的前一个结点q=p=i

6、nit();//这里是不是有个问题？？while(p->next!=NULL){a=p；if(p->WaitTime>=q->WaitTime){q=p；p=p->ncxt;q->WaitTime—;if(q->WaitTime==O)//如果等待吋间为0则把该进程从后备队列中移除{a->next=p->next;free(p);}returnq;〃选择等待吋间最久的)}//////////////////////就绪队列，入口函数为就绪队列的头指针/////////////intcount=0;PROCESS*ready_queu

7、e(PROCESS*head)//就绪队列优先级进入运行4道{PROCESS*p;while(count<4){p=FCFS_process();p->next=head->next;hcad=p;count++;printfC'theprocesshasinsertedintothereadyqueue:M);}returnhead;//insert_ready()//PROCESS*high_priority(PROCESS*P)//选择优先级最高的进程PROCESS*q,*p;//问题，入口形参中q=p；while(p->

8、next!=NULL){if(q->priority>p->priority)q=p；p=p->ncxt;}returnq;PROCESS*pick_ready(PROCESS*a)//从就绪队列中选择进程运行{PROCESS*p=r