进程调度算法实验.docVIP

#define MAX 5#includestdio.h#includestdlib.hint total_time=20;int time_slice=3;typedef struct process { // 进程控制块char pname[10];int WaitTime;int BurstTime;int priority; // 数字越小优先级越高struct process *next;}PROCESS;//typedef struct process PROCESS;PROCESS * in_queue(PROCESS *head,PROCESS *p); //声明PROCESS *init() //进程初始化{int i=0;char a;PROCESS *head_new; //队列的队头head_new=(struct process*)malloc(sizeof(struct process));if(!head_new) exit(1);head_new=NULL;do{struct process *s;printf(initialize the process:\n);s=(struct process *)malloc(sizeof(struct process));if(!s) exit(1);printf(please input the pname:WaitTime: BurstTime: priority:\n);scanf(%c,(s-pname));scanf(%d,(s-WaitTime));scanf(%d,(s-BurstTime));scanf(%d,(s-priority));s-next=NULL;in_queue(head_new,s);i++;printf(do u want to insert process more ?? YorN\n);printf(----------------------------------------\n);scanf(%c,a);scanf(%c,a);// if(a==Y||a==y) continue;// else if(a==N||a==n) break;}while((iMAX) (a==Y||a==y));return head_new;}///////////////////////////////////////////////////////////PROCESS *in_queue(PROCESS *head,PROCESS *p) //入队函数{if(head==NULL){head=p;p-next=NULL;}else {p-next=head;head=p;}// printf(the process insert into the mothball queue :\n);return head;}//////////////////////////////////////////////////////////////*void new_queue() //后备队列 先来先服务方式进入就绪{return *head_new;}*/PROCESS *FCFS_process(){PROCESS *p,*q,*a; //a用来记录选中结点的前一个结点q=p=init(); //这里是不是有个问题？？while(p-next!=NULL){a=p;if(p-WaitTime=q-WaitTime){q=p;p=p-next;}}q-WaitTime--;if(q-WaitTime==0) //如果等待时间为0则把该进程从后备队列中移除{a-next=p-next;free(p);}return q; //选择等待时间最久的）}//////////////////////就绪队列，入口函数为就绪队列的头指针/////////////int count=0;PROCESS *ready_queue(PROCESS *head) //就绪队列 优先级进入运行 4道{ PROCESS *p;while(count4){p=FCFS_process();p-next=head-next;head=p;count++;printf(the process has inserted into the ready queue :\n);}return head;}//ins