操作系统八大调度算法c/c++实现

// SchedulingAlgorithm.cpp: 定义控制台应用程序的入口点。 // #include <iostream> #include <stdio.h> #include <iomanip> #include <string> #include <list> using namespace std; //时间片 int TIMER=1; //事件类型 enum EventType { ARRIVAL_EVENT, FINISH_EVENT, TIMER_EVENT }; //任务结构 struct Job { string name; //作业名 int arriveTime=0; //作业到达时间 float needTime=0; //作业所需运行时间 int priority=0; //作业优先级，数字越小，优先级越高 Job(string name, int at, int nt, int p) { this->name = name; needTime = nt; arriveTime = at; priority = p; } Job(){} }; //事件链表结点 struct Event { EventType type= ARRIVAL_EVENT; //事件类型 int jobBeginTime=0; //作业开始时间 bool isFirstExe=true; //判断是否第一次执行，用于记录作业开始时间 int happenTime=0; //发生时刻 int remainTime=0; //剩余运行时间 double hrr=0; //最高响应比 Job job; //作业 Event *next=NULL; //事件指针 Event() { type = ARRIVAL_EVENT; jobBeginTime = 0; happenTime = 0; remainTime = 0; hrr = 0; job = Job(); next = NULL; isFirstExe = true; } Event(int ht, int jbt, Job j) { Event(); happenTime = ht; jobBeginTime = jbt; job = j; remainTime = j.needTime; } }; //*******************************事件队列相关函数************************************ /* 作业复制函数 */ void CopyJob(Job *dest, const Job *sour); /* 抓取头结点之外的第一个事件 * 作为返回值返回 */ Event *FetchFirstEvent(Event *head); /* 按作业名称删除第一个匹配项， * 删除成功返回TRUE，不存在该节点返回FALSE */ bool DeleteByJobName(Event *head, string jobName); /* 删除事件队列 */ void DestroyQueue(Event *head); //打印事件 void ShowEvent(Event* eventHead,Event *e); //事件初始化 void InitEvent(Event* &seventHead); //*******************************进程调度相关函数************************************ /* 插入函数 */ void InsertByHappenTime(Event *head, Event *e); void InsertByHRR(Event *head, Event *e); void InsertByJobTime(Event* eventHead,list<Event*> &q, Event *e); void InsertByPriority(Event* eventHead, list<Event*> &q, Event *e); void InsertByRemainTime(Event* eventHead, list<Event*> &q, Event *e); void InsertTail(Event* eventHead, list<Event*> &head, Event *e); /* 排序函数 */ void SortByHRR(list<Event*> &q, int currentTime); /* 调度函数 */ void FCFS(Event *eventHead); void SJF(Event *eventHead); void SRTF(Event *eventHead); void HRRF(Event *eventHead); void Priority(Event * eventHead); //抢占式优先级调 void RR(Event *eventHead); //时间片大小为1 void MFQ(Event *eventHead); //作业复制 void CopyJob(Job *dest, const Job *sour) { dest->name= sour->name; dest->arriveTime = sour->arriveTime; dest->needTime = sour->needTime; dest->priority = sour->priority; } //抓取头结点之外的第一个事件 Event *FetchFirstEvent(Event *head) { return head->next; } bool DeleteByJobName(Event *head, string jobName) { Event* cur = head; if (cur->job.name == jobName) { head = cur->next; return true; } while (cur->next) { if (cur->next->job.name == jobName) { cur->next = cur->next->next; return true; } cur = cur->next; } return false; } void DestroyQueue(Event *head) { delete head; head = NULL; } void ShowEvent(Event* eventHead,Event *e) { DeleteByJobName(eventHead, e->job.name); cout << setprecision(3) << fixed; cout << setw(12) << e->job.name<< setw(12) << e->job.arriveTime << setw(6) << "|" << setw(12) <<e->job.needTime << setw(12)<< e->job.priority << setw(12) << e->happenTime << setw(12) << e->jobBeginTime <<endl; } void InitEvent(Event* &eventHead) { if (eventHead == NULL) { cerr << "At: " << __FILE__ << "\nLine: " << __LINE__ << endl; throw "Head Point is NULL!\n"; } Event* nullEvent = new Event; nullEvent->next = eventHead; eventHead = nullEvent; } //按事件发生时间插入事件;早发生的事件排在前面 void InsertByHappenTime(Event *head, Event *e) { DeleteByJobName(head, e->job.name); if (head == NULL || e == NULL) { cerr << "At: " << __FILE__ << "\nLine: " << __LINE__ << endl; throw "H�