rr.m

来自「8个进程的改进版CPU schedule 算法-RoundRobin-所有上载程」· M 代码 · 共 23 行

M
23
字号
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





⌨️ 快捷键说明

复制代码Ctrl + C
搜索代码Ctrl + F
全屏模式F11
增大字号Ctrl + =
减小字号Ctrl + -
显示快捷键?