fcfs算法 c语言

一串平凡的代码

已于 2023-07-25 19:41:29 修改

阅读量517

点赞数 5

分类专栏：操作系统文章标签：算法数据结构 c语言

于 2023-04-01 15:29:55 首次发布

本文链接：https://blog.csdn.net/mdjsmg/article/details/129897633

版权

操作系统专栏收录该内容

5 篇文章 0 订阅

订阅专栏

该代码示例展示了如何用C语言实现FCFS进程调度算法，包括创建进程队列、按到达时间排序、模拟进程运行以及计算周转时间和带权周转时间。程序首先读取用户输入的进程信息，然后按照到达时间对进程进行调度并输出运行状态和相关时间指标。

摘要由CSDN通过智能技术生成

#include <malloc.h>
#include <stdio.h>

typedef struct 
{
	char name[10];//进程名
	int id;//进程id
	int atime;//到达时间
	int stime;//开始时间
	int runtime;//运行时间
	int ftime;//完成时间
	float total;//周转时间
	float weight;//带权周转时间
}PCB;

typedef struct _Node
{
	struct _Node* next;
	PCB pcb;
}node;

struct node* creat()
{
	node* head = malloc(sizeof(node));
	head->next = NULL;
	node* move = head;

	printf("请输入进程数量:\n");
	int count;
	scanf("%d", &count);
	for (int i = 0; i < count; i++)
	{
		node* fresh = malloc(sizeof(node));
		fresh->next = NULL;
		move->next = fresh;

		printf("请输入第%d个进程的id、到达时间、运行时间：\n", i + 1);
		scanf("%d%s%d%d", &fresh->pcb.id, fresh->pcb.name, &fresh->pcb.atime, &fresh->pcb.runtime);

		move = fresh;
	}
	return head;
}

void fcfs(node* head) {
	for (node* turn = head->next; turn->next != NULL; turn = turn->next)
	{
		for (node* move = head->next; move->next != NULL; move = move->next)
		{
			if (move->pcb.atime > move->next->pcb.atime)
			{
				PCB temp = move->pcb;
				move->pcb = move->next->pcb;
				move->next->pcb = temp;
			}
		}
	}
}

void running(node* head) {
	node* move = head->next;//创建move指针控制循环次数
	while (move != NULL) {
		printf("%s程序正在运行.....\n", move->pcb.name);
		move = move->next;
	}
}

void s_f_t_w_time(node* head) {
	node* move = head->next->next;//创建move指针控制循环次数
	node* first = head->next;//将首结点的地址数据传入first指针中
	first->pcb.total = first->pcb.runtime;
	first->pcb.stime = first->pcb.atime;
	first->pcb.ftime = first->pcb.stime + first->pcb.runtime;
	first->pcb.weight = first->pcb.total / first->pcb.runtime;
	printf("%d %4s %7d %11d %10d %10d %16f %10f\n", first->pcb.id, first->pcb.name, first->pcb.atime, first->pcb.runtime, first->pcb.stime, first->pcb.ftime, first->pcb.total, first->pcb.weight);
	while (move != NULL) {
		if (first->next->pcb.atime <= first->pcb.ftime) {
			first->next->pcb.stime = first->pcb.ftime;
			first->next->pcb.ftime = first->next->pcb.stime + first->next->pcb.runtime;
			first->next->pcb.total = first->next->pcb.stime + first->next->pcb.runtime - first->next->pcb.atime;
			first->next->pcb.weight = first->next->pcb.total / first->next->pcb.runtime;
		}
		else {
			first->next->pcb.stime = first->next->pcb.atime;
			first->next->pcb.ftime = first->next->pcb.stime + first->next->pcb.runtime;
			first->next->pcb.total = first->next->pcb.stime + first->next->pcb.runtime - first->next->pcb.atime;
			first->next->pcb.weight = first->next->pcb.total / first->next->pcb.runtime;
		}
		printf("%d %4s %7d %11d %10d %10d %16f %10f\n", first->next->pcb.id, first->next->pcb.name, first->next->pcb.atime, first->next->pcb.runtime, first->next->pcb.stime, first->next->pcb.ftime, first->next->pcb.total, first->next->pcb.weight);
		first = first->next;
		move = move->next;
	}
}

int main(void) {
	node* p;
	p = creat();
	fcfs(p);
	printf("\n");
	running(p);
	printf("\n");
	printf(" id    进程名   到达时间   运行时间   开始时间   结束时间   周转时间   带权周转时间\n");
	s_f_t_w_time(p);
	return 0;
}

编程小菜鸟，欢迎各位大佬指正错误或者不规范的地方！

运行结果在这下面：