class.h

来自「抢占式优先数调度算法」· C头文件 代码 · 共 66 行

#ifndef PCB_H
#define PCB_H

#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include "time.h"

using namespace std;

enum STATUS{RUN,READY,WAIT,FINISH};

struct PCBNode
{		
	int  processID;	          //进程ID
	STATUS  status;	          //进程状态
	int  priorityNum;	      //优先数
	int  reqTime;             //总的需要运行时间
	int  remainTime;          //剩下需要运行时间
	int  arriveTime;          //进入就绪队列时间
	int  startTime;           //开始运行时间
	int  finishTime;          //结束运行时间
	int  totalTime;           //周转时间
    float  weightTotalTime;	  //带权周转时间	
};

struct QueueNode 
{
	int ID;
	struct QueueNode * next;
};

struct LinkQueue
{
	QueueNode *head;
	QueueNode *tail;
};



class HPF
{
public:
	HPF::HPF(int n,int *arr_time,int *req_time,int *priority);
    void HPF::schedule();
	void HPF::enterQueue(int i);
	void HPF::Initial_Queue();
	void HPF::outQueue();
	int HPF::finish_justify();
    void HPF::run();
	int HPF::emptyQueue();
	void HPF::show_result();
	void HPF::search_new_arrProcess();
	void HPF::finsh_handle(int cpu_cur_user);
private:
	int cpu_cur_user;
	PCBNode * Process;
	LinkQueue Q;
	int cur_time;
	int ProcessNum;
};


#endif//PCB_H