rr.m

3个CPU调度算法的simulation. 分别是Short Job First,High Return Ration Next, Round Robin. 模拟得到R,U,S等重要指标。

function [newP,QReady,rmTime,curstartFlag]=RR(QReady,Qlen)
%It is SURE that there are processes in the queue now. now just to choose one
%The order is not important, so we can sort the queue first,then pick the
%first one. 
%But be CAREFUL if not full queue, should rule out the 0
%NOTE: newP is not newp!!!!!!!!!!!!

newP=-1; % if newp is -1 when return, we can find some problem because we can not access TB(-1)!!

%Just pick up the first p,like FCFS

[QReady,newP,rmTime,curstartFlag]=OutQueue3QReady(QReady,Qlen,0,'R');

if newP<=0
    fprintf('Not good! newP=%d\n',newP);
    return;
end