1、#include#define N 4#include /時間片系列#include#include#deflne MAX 4 進程數(shù)量#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； 記錄進程被運行的次數(shù)stnict pro *next;

2、mt TOTALTIME;記錄所有進程的總時間/時間片系列函數(shù)聲明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創(chuàng)建鏈袤，按照進程的到達時間排列，記錄所有進程的信息 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)插入節(jié)點stnict pro *p=seaicliByAT(head,s-amveTune)s-next=p-next;p-next=s;letuin;)stnict pro* searchByAT(stmct pro *headjnt AT)查找第一個到達時間大于等于AT的節(jié)點，返回其前一個指針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 的下一個節(jié)點stnict pro *tmp;tmp=p-next;p-next=tmp-next;fiee(tmp);retuni;) mt getCount(stnict pio *head,mt time)察看在 time 之前到達但未移動到運行隊列的進程數(shù)量(mt count=0;stiuct pros=head;t=s-next;while(t?=NULL&t-amveTimenext;count十十；count記錄當前時刻到達的進程數(shù)

6、)retuni count;)stmct pio* searchEnd(stnict pio *head) 查找并返回循壞隊列的尾節(jié)點的前一個節(jié)點(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個節(jié)點移動到循環(huán)隊列headT中(stmct pros=headF;t=s-next;r=t;/i-記錄要移動的第一個節(jié)點wlule(nl)t=t-next;n-；s-

7、next=t-next;以上完成從原隊列中摘除相關節(jié)點,i,t分別為第一個和最后一個節(jié)點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，新到達進程數(shù)struct pio *nuiliead=(stnict pio*)malloc(sizeof(stnict pro);nuiliead-next=nmliead;/創(chuàng)建新的循環(huán)鏈表，存放當前就緒隊列中的進程sti

8、uct pro *p,*q;p=imiliead;q=p-next; /q記錄當前應當運行的進程while(time0)moveCheadjiiiilieadjiewamve); 將 head 后的 newanive 個節(jié)點移動到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 * * *短作業(yè)優(yōu)先: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 * * *最高響應比優(yōu)先:wendl;Pimt(pjotalTinieSuni.weightTotalTmieSum); cou t w * endl .) void mam（）mt lg;coutw”請選擇任一種算法：,endl;3.TRRFcoutnl.FCFS （先來先服務）2.SWF （短作業(yè)優(yōu)先）3.TRRF(高響應比優(yōu)先)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)