最高响应比优先和先来先服务调度算法

#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
typedef struct JCB      //定义进程控制块
{
	int num;   //作业号
	int name;   //作业名
	char state;   //运行状态
	int  tijiaotime;  //提交作业时间,作业到达时间
	int  starttime;  //作业开始时间
	int  finishtime;  //结束时间
	int  needtime;   //运行需要时间
	float  weighttime; //带权周转时间
	struct JCB* next;  //指向下个作业
}jcb;
// fun reference
void sort();
void find_weight_max();
void input();
void run_HRN(jcb* p1, int* time);
void HRN();
//Global var..
int time_HRN = 0, time_FCFS, n;       //计时器            
jcb* head_FCFS = NULL, * head_HRN = NULL, * p_FCFS, * q_FCFS, * p_HRN, * p;
//fun definition
void run_HRN(jcb* p1, int* time)   //将R值最大的进程调入运行;
{
	*time = p1->tijiaotime > *time ? p1->tijiaotime : *time;
	p1->starttime = *time;
	printf("\ntime:%d,running task:%d\n", *time, p1->num);
	*time += p1->needtime;
	p1->state = 'F';
	p1->finishtime = *time;
	p1->weighttime = (p1->starttime - p1->tijiaotime) / (1.0 * p1->needtime) + 1;
	printf("name start need finish\n");
	printf("%d      %d       %d       %d ", p1->num, p1->starttime, p1->needtime, p1->finishtime);
}

void show(jcb* p)    //打印一个进程个体消息
{
	printf("\t%d\t%d\t%d\t%d\t%d\t%d\t%.2f\n", p->num, p->tijiaotime, p->needtime, p->starttime, p->finishtime, p->finishtime - p->tijiaotime, p->weighttime);
}

void fcfs()
{
	//请完成先来先服务调度算法
	int i, j, t;
	for (j = 0; j < n; j++)
	{
		p = head_FCFS;
		t = 10000;
		for (i = 0; i < n; i++)
		{
			if (p->tijiaotime < t && p->state == 'W') {
				t = p->tijiaotime;
				q_FCFS = p;
			}p = p->next;
		}
		run_HRN(q_FCFS, &time_FCFS);
	}
}

void HRN()            //所有任务是否结束;
{
	int flag = 1;
	jcb* tmp;
	while (flag == 1)
	{
		tmp = head_HRN;
		while (tmp)
		{
			if (tmp->state == 'W')
			{
				find_weight_max();
				break;
			}
			tmp = tmp->next;
		}
		if (!tmp)
			flag = 0;
	}

}
void find_weight_max()  //找到当前R值最大的进程;
{
	jcb* tmp, * max;
	int flag;
	float max_weight = -1;
	float weight;
	tmp = head_HRN;
	max = tmp;
	flag = 1;
	while (tmp && flag == 1)
	{
		if (tmp->state == 'F')
		{
			tmp = tmp->next;
			continue;
		}
		else if (tmp->tijiaotime > time_HRN)
			break;
		else
		{
			weight = 1 + (time_HRN - tmp->tijiaotime) / ((1.0) * tmp->needtime);  //R=(R+S)/S=1+W/S;
			if (max_weight < weight)
			{
				max_weight = weight;
				max = tmp;
			}
		}
		tmp = tmp->next;
	}
	run_HRN(max, &time_HRN);
}

void input()          //创建进程,初始化相关数据;
{
	int num;
	printf("\ntask number:");
	scanf("%d", &n);
	for (num = 0; num < n; num++)
	{
		p_FCFS = (jcb*)malloc(sizeof(jcb));
		p_HRN = (jcb*)malloc(sizeof(jcb));
		if (head_FCFS == NULL)
		{
			head_FCFS = p_FCFS;
			q_FCFS = p_FCFS;
		}
		printf("Ordering input：\nname，arrive，need\n");
		scanf("%d\t%d\t%d", &p_FCFS->num, &p_FCFS->tijiaotime, &p_FCFS->needtime);
		if (p_FCFS->tijiaotime < time_HRN)
			time_FCFS = p_FCFS->tijiaotime;
		q_FCFS->next = p_FCFS;
		p_FCFS->starttime = 0;
		p_FCFS->finishtime = 0;
		p_FCFS->next = NULL;
		p_FCFS->state = 'W';
		q_FCFS = p_FCFS;
		*p_HRN = *p_FCFS;   //同时将值赋给HRN;
		sort();
	}
	
	time_HRN = head_HRN->tijiaotime;
}
void sort() /* 建立对进程进行到达时间按早到晚排列函数*/
{
	jcb* first, * second;
	int insert = 0;
	if ((head_HRN == NULL) || ((p_HRN->tijiaotime) < (head_HRN->tijiaotime))) /*到达时间最早的放在队头*/
	{
		p_HRN->next = head_HRN;
		head_HRN = p_HRN;
	}
	else /* 进程到达时间比较,插入适当的位置中*/
	{
		first = head_HRN;
		second = first->next;
		while (second != NULL)
		{
			if ((p_HRN->tijiaotime) < (second->tijiaotime)) /*若插入进程比当前进程提交时间小,*/
			{ /*插入到当前进程前面*/
				p_HRN->next = second;
				first->next = p_HRN;
				second = NULL;
				insert = 1;
			}
			else /* 插入进程到达时间最晚,则插入到队尾*/
			{
				first = first->next;
				second = second->next;
			}
		}
		if (insert == 0) first->next = p_HRN;
	}
}
void main() {
	float switch_time = 0, weight_time = 0;
	printf("最高响应比优先算法(HRN)模拟......");
	input();    //初始化完毕!

	//先做HRN
	HRN();
	printf("\n\n   ..............................HRN.................................. \n\n");
	printf("\tname\tarrive\tneed\tstart\tfinish\tswitch\tweight  (time)\n");
	p = head_HRN;
	while (p) {
		show(p);
		switch_time += p->finishtime - p->tijiaotime;
		weight_time += p->weighttime;
		p = p->next;
	}
	printf("\tavg\t\t\t\t\t%.2f\t%.2f\n", switch_time / n, weight_time / n);
	printf("\n   ...................................................................\n");
	//后做FCFS
	fcfs();
	printf("\n\n   ............................FCFS................................... \n\n");
	printf("\tname\tarrive\tneed\tstart\tfinish\tswitch\tweight  (time)\n");
	p = head_FCFS;
	while (p) {
		show(p);
		switch_time += p->finishtime - p->tijiaotime;
		weight_time += p->weighttime;
		p = p->next;
	}
	printf("\tavg\t\t\t\t\t%.2f\t%.2f\n", switch_time / n, weight_time / n);
	printf("\n   ...................................................................\n");
	_getch();
}

运行结果: