进程调度算法模拟带答案版

int number_schedul,temp_counter; /*正在被调度执行的进程编号和已经调度完成的进程个数*/

float run_time; /*借助该局部变量可以帮助找到执行时间run_time最短进程*/ run_time=tasks[i].run_time; j=1;

/*从到达时间最早且相同的进程中查找第一个被调度的进程*/ while ((j

if (tasks[j].run_time

run_time=tasks[j].run_time; i=j; } j++; }

/*对第一个被调度的进程求相应的参数*/ number_schedul=i;

tasks[number_schedul].run_begin_time=tasks[number_schedul]e_time;

tasks[number_schedul].run_end_time=tasks[number_schedul].run_begin_time+tasks[number_schedul].run_time;

tasks[number_schedul].run_flag=1;

temp_time=tasks[number_schedul].run_end_time; tasks[number_schedul].order=1; temp_counter=1;

/*循环查找下一个被调度的进程，直到所有的tasks[j].run_flag ==1*/ while (temp_counter

{ /*找到在上一个进程执行期间（到\目前\为止）到达时间最晚的一个进程*/ for(j=0;j

if((tasks[j]e_time<=temp_time)&&(!tasks[j].run_flag))

{ run_time=tasks[j].run_time;number_schedul=j;break;} }

/* 找到到\目前\为止，最短的进程，即run_time 最小的进程*/ for(j=0;j

{ if((tasks[j]e_time<=temp_time)&&(!tasks[j].run_flag)) if(tasks[j].run_time

/*对找到的下一个被调度的进程求相应的参数*/ tasks[number_schedul].run_begin_time=temp_time;

tasks[number_schedul].run_end_time=tasks[number_schedul].run_begin_time+tasks[number_schedul].run_time;

tasks[number_schedul].run_flag=1;

temp_time=tasks[number_schedul].run_end_time; temp_counter++;

tasks[number_schedul].order=temp_counter; } return 0; }

/*非抢占式响应比高优先，默认tasks[0]是最早到达的进程，进程已按到达先后顺序排成了队列。*/ int hrrn()

{ int j,number_schedul,temp_counter;

float temp_time,respond_rate,max_respond_rate;

/*第一个进程被调度，系统刚开始运行时，同时到达的进程响应比都为0（按该程序所采用的等待时间/运

行时间这个公式算），因此按队列顺序必然是第一个进程最先被调度*/

tasks[0].run_begin_time=tasks[0]e_time;

tasks[0].run_end_time=tasks[0].run_begin_time+tasks[0].run_time; temp_time=tasks[0].run_end_time; tasks[0].run_flag=1; tasks[0].order=1; temp_counter=1; /*调度其他进程*/

while(temp_counter

max_respond_rate=0; /*找响应比高的进程*/ for(j=1;j

if((tasks[j]e_time<=temp_time)&&(!tasks[j].run_flag)) { respond_rate=(temp_time-tasks[j]e_time)/tasks[j].run_time; if (respond_rate>max_respond_rate) {

max_respond_rate=respond_rate; number_schedul=j; } } }

tasks[number_schedul].run_begin_time=temp_time;

tasks[number_schedul].run_end_time=tasks[number_schedul].run_begin_time+tasks[number_schedul].run_time;

temp_time=tasks[number_schedul].run_end_time; tasks[number_schedul].run_flag=1; temp_counter+=1;

tasks[number_schedul].order=temp_counter;

} return 0; }

int pinput() /*进程参数输入*/ { int i;

printf(\ scanf(\

for(i=0;i

{ printf(\ printf(\ printf(\ scanf(\

printf(\ scanf(\

printf(\ scanf(\

printf(\ scanf(\ printf(\ scanf(\ tasks[i].run_begin_time=0; tasks[i].run_end_time=0; tasks[i].order=0; tasks[i].run_flag=0; } return 0; }

int poutput() /*调度结果输出*/ {