抢占优先数调度算法和时间片轮转调度算法

1、#include <iostream>#include <stdlib.h>#include <cstring>#include <stdio.h> using namespace std;class pcbpublic:char name;int prioORround; int cputime;int count;int needtime; char state; pcb *next;class createpcbpublic:pcb* newpcb(int count) private:pcb *apcb=new pcb; switch(c

2、ount)case 1: apcb->name='a'break; case 2: apcb->name='b'break; case 3: apcb->name='c'break; case 4: apcb->name='d'break; case 5: apcb->name='e'break; default: cout<<" 错误" apcb->prioORround=45+rand()%5; apcb->cputime=0;apcb-

3、>count=0; apcb->needtime=10+rand()%5; apcb->state='R'apcb->next=NULL; return apcb;pcb *;class printpublic:void printf(pcb *ready,pcb *tail,pcb *finish,pcb *run)p=run;cout<<" 运行： "while(p->next!=NULL)p=p->next; cout<<p->name<<":"<&

4、lt;p->needtime<<"t"p=ready;coutvv"就绪："while(p->next!=tail)p=p->next; coutvvp->namevv":"vvp->needtimevv"t"p=finish;coutvv"完成："while(p->next!=NULL)p=p->next; coutvvp->namevv":"vvp->needtimevv"t"coutv

5、vendl;private:pcb *p;class insert1public:void insert(pcb *ready,pcb *tail)k=ct.newpcb(ready->count);ready->count+=1;p=ready;while(p->next!=tail&&p->next->prioORround>k->prioORround) p=p->next;k->next=p->next;p->next=k;void insert(pcb *ready,pcb *tail,pcb *fin

6、ish,pcb *run) pt.printf(ready,tail,finish,run); k=run->next;k->prioORround-=3; k->cputime+=1; k->needtime-=1;k->state='R' k->next=NULL; run->next=NULL;if(k->needtime>0) p=ready;while(p->next!=tail&&p->next->prioORround>k->prioORround) p=p->

7、;next;k->next=p->next;p->next=k;elsep=finish;while(p->next!=NULL)p=p->next; p->next=k;private:pcb *p;pcb *k;createpcb ct;print pt;class insert2public:void insert(pcb *ready,pcb *tail) k=ct.newpcb(ready->count); ready->count+=1; p=ready; while(p->next!=tail) p=p->next;k-

8、>next=p->next;p->next=k;void insert(pcb *ready,pcb *tail,pcb *finish,pcb *run)pt.printf(ready,tail,finish,run);k=run->next;k->cputime+=2;k->needtime-=2;k->state='R'k->next=NULL;run->next=NULL;if(k->needtime>0)p=ready;while(p->next!=tail)p=p->next;k->

9、next=p->next;p->next=k;elsep=finish;while(p->next!=NULL)p=p->next;p->next=k;private:pcb *p;pcb *k;createpcb ct;print pt;class firstinpublic:void runs(pcb *ready,pcb *tail,pcb *run)if(ready->next!=tail)p=run;p->next=ready->next;p=p->next;ready->next=p->next;p->stat

10、e='W'p->next=NULL; private:pcb *p; ;class prisch public: prisch() private:system("cls"); ='R' ready.count=1; ='T' ='F' ready.next=&tail; tail.next=NULL; finish.next=NULL; run.next=NULL; printf("ttt 优先级数调度 n"); w

11、hile(1)if(ready.count<=5) inst.insert(&ready,&tail);fir.runs(&ready,&tail,&run); inst.insert(&ready,&tail,&finish,&run); if(ready.next=&tail)break; pt.printf(&ready,&tail,&finish,&run); getchar();pcb *p; pcb ready; pcb tail;pcb finish; pcb r

12、un; insert1 inst; firstin fir; print pt; string algo;class roundschpublic:roundsch() system("cls"); ='R' ready.count=1; ='T' ='F' ready.next=&tail; tail.next=NULL; finish.next=NULL; run.next=NULL; printf("ttt 时间片轮转调度 n");

13、while(1)if(ready.count<=5) inst.insert(&ready,&tail); fir.runs(&ready,&tail,&run); inst.insert(&ready,&tail,&finish,&run); if(ready.next=&tail)break;pt.printf(&ready,&tail,&finish,&run); getchar();private:pcb *p;pcb ready;pcb tail;pcb finish

14、;pcb run;insert2 inst;firstin fir;print pt;class menupublic:menu()char c;bool z=false;while(1)system("cls");cout<<"nnntt* 抢占优先数调度算法和 时间片轮转调度算法 *nn"<<endl;int main(int args,char* argv) menu menu; return 0;<<"tt*ttt1, 优先级数调度 tt*n"<<endl <<"tt*tt2, 时间片轮转调度 tt*n"<<endl <<"tt*t3, 退出程序 tttt*n"<<endln"<<endl;if(z=true)cout<<"tttt 选择输入错误！ "<<endl