initialization.cpp

来自「抢占式优先数调度算法」· C++ 代码 · 共 29 行

#include "class.h"
HPF::HPF(int n,int *arr_time,int *req_time,int *priority)
{
	Process=new PCBNode[n];
	ProcessNum=n;//cout<<n;
	for (int i=0;i<ProcessNum;i++)
	{
	//	cout<<req_time[i]<<endl;
		Process[i].processID=i;
		Process[i].arriveTime=arr_time[i];
		Process[i].reqTime=req_time[i];
		Process[i].finishTime=0;
		Process[i].startTime=0;
		Process[i].remainTime=req_time[i];
		Process[i].priorityNum=priority[i];
		Process[i].status=WAIT;
		Process[i].totalTime=0;
		Process[i].weightTotalTime=0;		
	}
	Initial_Queue();
//	cout<<emptyQueue()<<endl;exit(0);
	cpu_cur_user=-1;
	cur_time=0;
}