进程调度模拟

#include<iostream>
#include<stack>
#include<string>
#include<iomanip>
using namespace std;
//enum status{ready,run,finish};
struct PCB {
	string process_tag;
	PCB* next;
	int process_priority;
	int cputime;
	int process_time;
	string process_status;
	PCB()
	{
		this->cputime = 0;
		this->process_priority = (int)(rand() % (10 - 1 + 1)) + 1;//1到10之间的随机数
		this->process_time= (int)(rand() % (10 - 1 + 1)) + 1;//1到10之间的随机数
		this->process_status = "ready";//准备队列
		this->next = NULL;
	}
};
struct PCBList {
	PCB* run;//运行队列的头指针
	PCB* ready;//准备队列的头指针
	PCB* finish;//结束队列的头指针
	PCBList()
	{
      this->run = NULL;
	  this->ready = NULL;
	  this->finish = NULL;
	}
};
/*********将就绪队列中的PCB按优先数的大小从高到低排序***********/
void sort_PCBList (PCBList* p) {

	PCB* q;
	PCB* q1;
	for (q= p->ready;q;q = q->next)
	{
		for (q1 = q->next;q1;q1 = q1->next)
		{
			if (q->process_priority < q1->process_priority)
			{
				swap(q->cputime, q1->cputime);
				swap(q->process_priority, q1->process_priority);
				swap(q->process_tag, q1->process_tag);
				swap(q->process_time, q1->process_time);
			}
		}
	}

}
void dis_PCBList(PCBList* q) {
	PCB* head_ready = q->ready;
	PCB* head_run = q->run;
	PCB* head_finish = q->finish;
	PCB* cur_ready=head_ready;
	PCB* cur_run=head_run;
	PCB* cur_finish=head_finish;
	cout <<setw(9)<< "tag" <<setw(13)<<"cputime" <<setw(13)  << "time" << setw(13)  << "priority" << setw(13)  << "status"  << endl;
	while (cur_run)
	{
		cout << cur_run->process_tag << setw(13) << cur_run->cputime << setw(13)  << cur_run->process_time << setw(13) << cur_run->process_priority << setw(13)  << cur_run->process_status << endl;
         cur_run = cur_run->next;
	}
	while (cur_ready)
	{
		cout << cur_ready->process_tag << setw(13) << cur_ready->cputime << setw(13) << cur_ready->process_time << setw(13) << cur_ready->process_priority << setw(13) << cur_ready->process_status << endl;
		cur_ready = cur_ready->next;
	}
	while (cur_finish)
	{
		cout << cur_finish->process_tag << setw(13) << cur_finish->cputime << setw(13) << cur_finish->process_time << setw(13) << cur_finish->process_priority << setw(13) << cur_finish->process_status << endl;
		cur_finish = cur_finish->next;
	}
}
/************优先数算法**********/
void  PSA(PCBList* p){

	PCBList* q = p;
	sort_PCBList(q);
	PCB* cur_run=q->run;
	PCB* cur_ready=q->ready;
	PCB* cur_finish=q->finish;
	while (q->ready != NULL)
	{
		q->run = q->ready;
		q->ready = q->ready->next;
		q->run->next = NULL;
		q->run->process_status = "run";
		q->run->cputime++;
		dis_PCBList(q);
		q->run->process_priority -= 3;
		q->run->process_time -= 1;
		if (q->run->process_time == 0)
		{
			if (q->finish==NULL)
			{
				q->finish = q->run;
				q->finish->process_status = "finish";
				q->finish->next = NULL;
				cur_finish = q->finish;
			}
			else
			{
				cur_finish->next = q->run;
				cur_finish = cur_finish->next;
				cur_finish->process_status = "finish";
				cur_finish->next = NULL;
			}
		}
		else
		{
			if (q->ready != NULL)
			{
				cur_ready = q->ready;
				while (cur_ready)
				{
					if (cur_ready->process_priority < q->run->process_priority)
					{
						break;
					}
					cur_run = cur_ready;
					cur_ready = cur_ready->next;
				}
				/*********把此时的q->run插入到ready中*****/
			/*	if (cur_ready == q->ready)
				{
					q->run->process_status = "ready";
					q->run->next = q->ready;
					q->ready = q->run;
				}
				else
				{
					q->run->process_status = "ready";
					q->run->next = cur_run->next;
					cur_run->next = q->run;
				}
			}
			else
			{
				q->ready = q->run;
			}
		}

	}
	q->run = NULL;
	dis_PCBList(q);
}
/*********轮盘调度算法*******/
void RR(PCBList* p){
	PCBList* q = p;
	PCB* cur_run = q->run;
	PCB* cur_ready = q->ready;
	PCB* cur_finish = q->finish;
	while (q->ready != NULL)
	{
		q->run = q->ready;
		q->ready = q->ready->next;
		q->run->next = NULL;
		q->run->process_status = "run";
		q->run->cputime++;
		dis_PCBList(q);
		q->run->process_time -= 1;
		if (q->run->process_time == 0)
		{
			if (q->finish == NULL)
			{
				q->finish = q->run;
				q->finish->process_status ="finish";
				q->finish->next = NULL;
				cur_finish = q->finish;
			}
			else
			{
				cur_finish->next = q->run;
				cur_finish = cur_finish->next;
				cur_finish->process_status = "finish";
				cur_finish->next = NULL;
			}
		}
		else//把q->run插入ready队列的尾部
		{
			if (q->ready != NULL)
			{
				cur_ready = q->ready;
				while (cur_ready->next)
				{
					cur_ready = cur_ready ->next;
				}

				cur_ready->next = q->run;
				q->run->process_status = "ready";
				q->run->next= NULL;

			}
			else
			{
				q->ready = q->run;
				q->run->process_status = "ready";
				q->run->next = NULL;
			}
		}
	}
	q->run = NULL;
	dis_PCBList(q);
}



int main()
{
	PCBList* list = new PCBList();
	PCB* head = new PCB();
	head->process_tag = "process_" + to_string(0);
	list->ready = head;
	//cout << head->process_tag << " " << head->cputime << " " << head->process_time << " " << head->process_priority << " " << head->process_status;
	for (int i = 1;i <= 9;i++)
	{
		head->next = new PCB();
		(head->next)->process_tag = "process_" +to_string(i);
		head = head->next;
	}
	dis_PCBList(list);
	sort_PCBList(list);
	//dis_PCBList(list);
	PSA(list);
	//cout << "hello! world!" << endl;
	//RR(list);
	//getchar();
	return 0;

}

 

【实验目的】 1. 理解进程的概念,熟悉进程的组成; 2. 用高级语言编写和调试一个进程调度程序,以加深对进程调度算法的理解。 【实验准备】 1. 几种进程调度算法  短进程优先调度算法  高优先权优先调度算法  先来先服务调度算法  基于时间片的轮转调度算法 2. 进程的组成  进程控制块(PCB)  程序段  数据段 3. 进程的基本状态  就绪W(Wait)  执行R(Run)  阻塞B(Block) 【实验内容】 1. 例题 设计一个有 N个进程共行的进程调度程序。 进程调度算法:采用最高优先数优先的调度算法(即把处理机分配给优先数最高的进程)和先来先服务算法。 每个进程有一个进程控制块(PCB)表示。进程控制块可以包含如下信息:进程名、优先数、到达时间、需要运行时间、已用CPU时间、进程状态等等。进程的优先数及需要的运行时间可以事先人为地指定(也可以由随机数产生)。进程的到达时间为进程输入的时间。进程的运行时间以时间片为单位进行计算。每个进程的状态可以是就绪 W(Wait)、运行R(Run)、或完成F(Finish)三种状态之一。就绪进程获得 CPU后都只能运行一个时间片。用已占用CPU时间加1来表示。如果运行一个时间片后,进程的已占用 CPU时间已达到所需要的运行时间,则撤消该进程,如果运行一个时间片后进程的已占用CPU时间还未达所需要的运行时间,也就是进程还需要继续运行,此时应将进程的优先数减1(即降低一级),然后把它插入就绪队列等待CPU。每进行一次调度程序都打印一次运行进程、就绪队列、以及各个进程的 PCB,以便进行检查。重复以上过程,直到所要进程都完成为止。 4. 实验题目  编写并调试一个模拟进程调度程序,采用“最高优先数优先”调度算法对五个进程进行调度。“最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。静态优先数是在创建进程时确定的,并在整个进程运行期间不再改变。动态优先数是指进程的优先数在创建进程时可以给定一个初始值,并且可以按一定原则修改优先数。例如在进程获得一次CPU后就将其优先数减少1。或者,进程等待的时间超过某一时限时增加其优先数的值,等等。  编写并调试一个模拟进程调度程序,采用“轮转法”调度算法对五个进程进行调度。轮转法可以是简单轮转法、可变时间片轮转法,或多队列轮转法。简单轮转法的基本思想是:所有就绪进程按 FCFS排成一个队列,总是把处理机分配给队首的进程,各进程占用CPU的时间片相同。如果运行进程用完它的时间片后还为完成,就把它送回到就绪队列的末尾,把处理机重新分配给队首的进程。直至所有的进程运行完毕。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值