search_new_arrprocess.cpp

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

#include "class.h"
void HPF::search_new_arrProcess()
{
	for(int i=0;i<ProcessNum;i++)
	{
		if(Process[i].arriveTime==cur_time)
		{
			enterQueue(i);
			cout<<"进程: "<<i<<"进入就绪队列"<<"    权:"<<Process[i].priorityNum<<endl;
			Process[i].status=READY;
		}
	}
}