先来先服务、短作业优先、时间片轮转、高优先权算法

1、#include#define N 4#include /时间片系列#include#include#deflne MAX 4 进程数量#define RR 4 时间片大小/时间片系列using namespace std;stnict timestrmg name;float aniveTime;float niiiTime;float finishTmie;float totalTime;float weightTotalTime;/时间片系列stnict prochar num;mt aniveTime;mt burst;mt H； 记录进程被运行的次数stnict pro *next;

2、mt TOTALTIME;记录所有进程的总时间/时间片系列函数声明stnict pro* cieatListO；void inseit(stnict pio *head,stnict pro *s);stnict pio* searchByAT(stmct pio *headjnt AT);void del(stnict pro* p);mt getCount(stnict pio *head,mt time);stnict pro* searchEnd(sti-uct pro *head);void move(stmct pio *headEstmct pro *lieadTjnt n);s

3、tnict pro* cieatListO创建链袤，按照进程的到达时间排列，记录所有进程的信息 stnict pro* liead=(stnict pio*)malloc(sizeof(stnict pio); liead-next=NULL;stmct pro* s;mt i;TOTALTIME=0;coutw”输入进程名&到达时间&运行时间(examples 0 0):vendl; coutnname HHanivetinie n,nuitimeendl;foi(i=0;inum;cins-amveTime;cins-buist;TOTALTIME+=s-buist; 计算总时间s-it=

4、l; /it的初始值为1s-next=NULL;uisert(head,s);)reuun head;到达队列中的进程按照其到达时间的先后顺序排列) “void inseit(stnict pro *head,struct pro *s)插入节点stnict pro *p=seaicliByAT(head,s-amveTune)s-next=p-next;p-next=s;letuin;)stnict pro* searchByAT(stmct pro *headjnt AT)查找第一个到达时间大于等于AT的节点，返回其前一个指针stnict pro *p,*q;p=head;q=head-n

5、ext;while(q! =NULL&q-an iveTmienext;)return p;)void del(stnict pro* p) 删除 p 的下一个节点stnict pro *tmp;tmp=p-next;p-next=tmp-next;fiee(tmp);retuni;) mt getCount(stnict pio *head,mt time)察看在 time 之前到达但未移动到运行队列的进程数量(mt count=0;stiuct pros=head;t=s-next;while(t?=NULL&t-amveTimenext;count十十；count记录当前时刻到达的进程数

6、)retuni count;)stmct pio* searchEnd(stnict pio *head) 查找并返回循坏队列的尾节点的前一个节点(struct pro *p,*q;p=head;q=head-next;while(q-next! =liead)p=q； q=q-next;)return p;)void move(stmct pro *headEstnict pro *lieadTjnt n) 将headF后的n个节点移动到循环队列headT中(stmct pros=headF;t=s-next;r=t;/i-记录要移动的第一个节点wlule(nl)t=t-next;n-；s-

7、next=t-next;以上完成从原队列中摘除相关节点,i,t分别为第一个和最后一个节点s=seafcliEnd(headT); if(s!=headT) s=s-next; t-next=s-next; s-next=r;stmct pro *f=s;) void nin(stnict pio *head) (mt tnne=0; 记录当前时间mt newaiiive，新到达进程数struct pio *nuiliead=(stnict pio*)malloc(sizeof(stnict pro);nuiliead-next=nmliead;/创建新的循环链表，存放当前就绪队列中的进程sti

8、uct pro *p,*q;p=imiliead;q=p-next; /q记录当前应当运行的进程while(time0)moveCheadjiiiilieadjiewamve); 将 head 后的 newanive 个节点移动到runhead队列中if(Rmliead-next=imiliead)就绪队列中没有进程time+;else if(q=niiiliead) (p=q;q=q-next;elsecoutn 进 程名:nq-numendl;coutn 到达时间:nq-arnveTmieendl; if(q-it=l)piintf(响应时间:dn,time-q-arriveTime);

9、elseprintf(第d 次运行开始时间:dn”,q-rt,time); if(q-buistbuist;printf(“第d 次运行结束时间:dn”,qrt,time); printf(周转时间:dn”,time-q-arriveTime);piintfC * *stnict pio *tmp=q;q=q-next;p-next=q;imiliead-next=q;fiee(tmp);else /q-buistRRtinie+=RR;pnntf(第d 次运行结束时间priiitf(n *q-buist-=RR;q-rt+;stnict pro *h;h=iiiiiliead-next;if

10、(h-next! =nuiliead)while(h-next! =nniliead) li=h-next;niiiliead-next=q-next; h-next=q;q-next=iiuiliead;q=nuiliead-next; else stnict pro *n;n=q;p=q;q=q-next;)/时间片系列void niputTime(time *p) (int i;/countercoutHinput name & anive time & nin time(example:a 0O):Mendl;cout1lname Mnanivetime nunmtimeuendl;f

11、br(i=O;i=N-l;i+)float templ,temp2;stung name;cinname;=name;cintempl;pi .amveTime=temp 1;cintemp2;pi .ninTime=temp2;)void Piint(time *p,float totalTmieSum,floatweightTotalTmieSum) coutH * 运行次序:Hendl;for(int k=0;k=N-l ;k+) (n)coutendl;coutw” 平均周转时间: vvtotalTuneSunVNvvendl;coutw”平均带权周

12、转时间:vvweightTotalTimeSum/Nvveiidl; )void soit(tinie *p) fbi(int i=0;i=N-l;i+)fdr(mtj=O;j=i;j+).aniveTimevpj .aniveTune) tune temp;temp=pi;Pi=PUl； p|j=temp;)void deal(tune *p,float &totalTimeSuni.float&weightTotalTimeSum)int k;/counter fbr(k=0;k=N-1 ;k+)if(k=0)pk .fiiiishTinie=pk .arriveTinie+pk .run

13、Time; elsep k. finishTinie=p k-1 .finishTmie+pk .iiinTune;fbr(k=O;k=N-1 ;k+)p k.totalTime=p k. fiiiishTiine-p k.amveTnne;pk .weightTotalTime=pk .totalTiine/pk .runTiine;totalTimeSum+=pk .totalTiine;weightTotaiTimeSmn+=pk.weightTotalTiiiie;)void FCFS(tune *p) (float totalTuneSum=0.weightTotalTmieSum=

14、0;sort(p)；deal(p,totalTuneSum,weightTotalTimeSum); coutendl;coutw * endl coutn* * *先来先服务:endl;Piint(p,totalTmieSum,weightTotalTimeSum); cout w * endL void SWF(tune *p)float totalTuneSum=0.weightTotalTuneSum=0;sort(p);fbf(int m=0;mN-l;m+)(if(m=0)pm .fuiishTime=pm .aiT iveTime+pm .iiinTmie; elsep m. f

15、inishTmie=p m-1 . finisliTime+p m .iiinTune;mt 1=0;fbr(mt n=m+ l;n=N-l ;n 十十)(if(pn .amveTmie=pm .fiiushTime) i+；)float min=pm+1 .iiinTime;mt fbllow=m+l;fbr(mt k=m+l；km+i;k+)(if(p k+1 .iiuiTimemin)min=pk+1 .iunTime;fdllow=k+l;)time temp;temp=pm+l;pm+1 =pfollow;pfbllow=temp;)deal(p,totalTmieSum,weigh

16、tTotalTimeSum); coutendl;cout* endcoutH * * *短作业优先:wendl;Pimt(p,totalTimeSuni.weightTotalTmieSum);void TRRF(tune *p)float totalTimeSum=0,weightTotalTimeSum=0;sort(p);fbr(int m=0;mN-l;m+) (if(m=0)pm .fuiishTime=pm .amveTune+pm .ninTime; elsep m. fimshTmie=p m-1 . finisliTime+p m .ninTime;mt 1=0;fbr(m

17、t n=m+ l;n=N-l;n+) if(pn .amveTmie=pm .fiiushTime)1+;)float max=(pm .fiiushTime-pm+l .arnveTune)/pm+l.iiinTime;mt fbllow=m+l;fbr(mt k=m+l;km+i;k+) if(max=(pm .fiiushTmie-p k+1 .aniveTmie)/pk+l.runTime)max=(p m.finishT ime-p k+1 . arriveTime)/pk+l.iiinTune;fdllow=k+l;)time temp;temp=pm+l;pm+1 =pfollo

18、w;pfbllow=temp;deal(p9totalTimeSum5weightTotalTmieSum); coutendl;cou t w * endl coutH * * *最高响应比优先:wendl;Pimt(pjotalTinieSuni.weightTotalTmieSum); cou t w * endl .) void mam（）mt lg;coutw”请选择任一种算法：,endl;3.TRRFcoutnl.FCFS （先来先服务）2.SWF （短作业优先）3.TRRF(高响应比优先)4.RR (时间片轮转)0.退出“vvendl;cinlg;coutendl;time aN,bN,cN;while (1g)lf(lg=l)LiputTime(a);FCFS(a);coutendl;/tune *b=a;time *c=a;if(lg=2)