2022年2022年进程调度算法实现代码 .pdf

进程调度算法实现/数据：进程，队列结构/处理流程：/1 初始化-进程队列结构（包括：就绪队列，等待队列，运行队列）等必要的数据结构init();/2 进入无限循环，反复调度队列#define MAX 5#include#include int total_time=20;int time_slice=3;typedef struct process /进程控制块 char pname10;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;/队列的队头名师资料总结-精品资料欢迎下载-名师精心整理-第 1 页，共 7 页 -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?YorNn);printf(-n);scanf(%c,&a);scanf(%c,&a);/if(a=Y|a=y)continue;/else if(a=N|a=n)break;while(inext=NULL;else p-next=head;head=p;/printf(the process insert into the mothball queue:n);return head;/*void new_queue()/后备队列先来先服务方式进入就绪 return*head_new;*/名师资料总结-精品资料欢迎下载-名师精心整理-第 3 页，共 7 页 -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 道 名师资料总结-精品资料欢迎下载-名师精心整理-第 4 页，共 7 页 -PROCESS*p;while(countnext=head-next;head=p;count+;printf(the process has inserted into the ready queue:n);return head;/insert_ready()/PROCESS*high_priority(PROCESS*P)/选择优先级最高的进程 PROCESS*q,*p;/问题，入口形参中 q=p;while(p-next!=NULL)if(q-priorityp-priority)q=p;p=p-next;return q;名师资料总结-精品资料欢迎下载-名师精心整理-第 5 页，共 7 页 -PROCESS*pick_ready(PROCESS*a)/从就绪队列中选择进程运行 PROCESS*p=ready_queue(a);PROCESS*b=high_priority(p);return b;void run(PROCESS*a)/运行一个时间片 while(time_slice0)&(a-BurstTime0)/指针用-变量用.printf(the process%c is runing,a-pname);printf(the process BurstTime time is%d,a-WaitTime);printf(the process BurstTime time is%d,a-BurstTime);printf(the process priority is%d,a-priority);a-BurstTime-;time_slice-;a-priority-;total_time-;/*if(a-runtime0)return a;else return NULL;*/void main()PROCESS*p;PROCESS*head=init();名师资料总结-精品资料欢迎下载-名师精心整理-第 6 页，共 7 页 -while(total_time!=0)ready_queue(head);p=pick_ready(head);if(p-BurstTime=0)p=p-next;free(p);count-;run(p);time_slice=3;名师资料总结-精品资料欢迎下载-名师精心整理-第 7 页，共 7 页 -