時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法

1、 實(shí)驗(yàn)二 時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法【實(shí)驗(yàn)?zāi)康摹?通過這次實(shí)驗(yàn)，加深對(duì)進(jìn)程概念的理解，進(jìn)一步掌握進(jìn)程狀態(tài)的轉(zhuǎn)變、進(jìn)程調(diào)度的策略及對(duì)系統(tǒng)性能的評(píng)價(jià)方法。【實(shí)驗(yàn)內(nèi)容】問題描述：設(shè)計(jì)程序模擬進(jìn)程的時(shí)間片輪轉(zhuǎn)RR調(diào)度過程。假設(shè)有n個(gè)進(jìn)程分別在T1, ,Tn時(shí)刻到達(dá)系統(tǒng)，它們需要的服務(wù)時(shí)間分別為S1, ,Sn。分別利用不同的時(shí)間片大小q，采用時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法進(jìn)行調(diào)度，計(jì)算每個(gè)進(jìn)程的完成時(shí)間，周轉(zhuǎn)時(shí)間和帶權(quán)周轉(zhuǎn)時(shí)間，并且統(tǒng)計(jì)n個(gè)進(jìn)程的平均周轉(zhuǎn)時(shí)間和平均帶權(quán)周轉(zhuǎn)時(shí)間。程序要求：1）進(jìn)程個(gè)數(shù)n；每個(gè)進(jìn)程的到達(dá)時(shí)間T1, ,Tn和服務(wù)時(shí)間S1, ,Sn；輸入時(shí)間片大小q。2）要求時(shí)間片輪轉(zhuǎn)法RR調(diào)度進(jìn)

2、程運(yùn)行，計(jì)算每個(gè)進(jìn)程的周轉(zhuǎn)時(shí)間，帶權(quán)周轉(zhuǎn)時(shí)間，并且計(jì)算所有進(jìn)程的平均周轉(zhuǎn)時(shí)間，帶權(quán)平均周轉(zhuǎn)時(shí)間；3）輸出：要求模擬整個(gè)調(diào)度過程，輸出每個(gè)時(shí)刻的進(jìn)程運(yùn)行狀態(tài)，如“時(shí)刻3：進(jìn)程B開始運(yùn)行”等等；4）輸出：要求輸出計(jì)算出來的每個(gè)進(jìn)程的周轉(zhuǎn)時(shí)間，帶權(quán)周轉(zhuǎn)時(shí)間，所有進(jìn)程的平均周轉(zhuǎn)時(shí)間，帶權(quán)平均周轉(zhuǎn)時(shí)間?！驹闯绦颉?include<iostream.h>#include<iomanip.h>#include<stdio.h>#include<conio.h>#include<malloc.h>#include<stdlib.h>typ

3、edef int QElemType;#define OK 1#define ERROR 0#define OVERFLOW -1typedef int Status;typedef struct QNodeQElemType data;struct QNode *next;QNode,*QueuePtr;typedef structQueuePtr front;QueuePtr rear;LinkQueue;Status InitQueue(LinkQueue &Q);Status DestroyQueue(LinkQueue &Q);Status EnQueue(LinkQ

4、ueue &Q,QElemType e);int DeQueue(LinkQueue &Q,QElemType e);bool QueueEmpty(LinkQueue &Q);static const int MaxNum=100; int n,q,ArrivalTimeMaxNum,ServiceTimeMaxNum,FinishedTimeMaxNum,WholeTimeMaxNum; double WeightWholeTimeMaxNum,Average_WT=0,Average_WWT=0; LinkQueue Q;void RR(int*ArrivalTi

5、me,int*ServiceTime,int n,int q,LinkQueue &Q);void main() cout<<"請(qǐng)輸入進(jìn)程數(shù)n:"cin>>n;while(n<0|n>100)cout<<"輸入的n值不正確，請(qǐng)重新輸入！"<<endl;cin>>n;cout<<"請(qǐng)輸入各個(gè)進(jìn)程的到達(dá)時(shí)間："for(int i=0;i<n;i+)cin>>ArrivalTimei;cout<<"請(qǐng)輸入各個(gè)進(jìn)

6、程的服務(wù)時(shí)間："for( i=0;i<n;i+)cin>>ServiceTimei;cout<<"請(qǐng)輸入時(shí)間片q:"cin>>q;while(q<0|q>200)cout<<"輸入的q值不正確，請(qǐng)重新輸入！"<<endl;cin>>q;RR(ArrivalTime,ServiceTime,n,q,Q);void RR(int*ArrivalTime,int*ServiceTime,int n,int q,LinkQueue &Q)int count

7、Time=0,e;int STimeMaxNum,pushedMaxNum;for(int i=0;i<n;i+)STimei=ServiceTimei;pushedi=0;InitQueue(Q);EnQueue(Q,0);pushed0=1;int time=0;while(QueueEmpty(Q)=false) e=DeQueue(Q,e);if(STimee>q)STimee=STimee-q;countTime+=q;elsecountTime+=STimee;STimee=0;FinishedTimee=countTime;while(time<countTim

8、e)if(STime>0)cout<<"時(shí)刻"<<setw(2)<<time<<":進(jìn)程"<<e<<"正在運(yùn)行"<<endl;time+;for(i=1;i<n;i+)if(STime!=0&&i!=e&&ArrivalTimei<countTime&&pushedi=0|STime!=0&&i!=e&&ArrivalTimei=countTime)EnQ

9、ueue(Q,i);pushedi=1;if(STimee>0)EnQueue(Q,e);for(i=0;i<n;i+)WholeTimei=FinishedTimei-ArrivalTimei;WeightWholeTimei=(double)(WholeTimei*1.000000/ServiceTimei); Average_WT+=WholeTimei;Average_WWT+=WeightWholeTimei;Average_WT/=n;Average_WWT/=n;cout<<"完成:"<<" "for(i

10、=0;i<n;i+)cout<<setw(8)<<FinishedTimei<<" "cout<<endl;cout<<"周轉(zhuǎn):"<<" "for(i=0;i<n;i+) cout<<setw(8)<<WholeTimei<<" "cout<<endl;cout<<"帶權(quán)："<<" "for(i=0;i<n;i+)

11、cout<<setw(8)<<setiosflags(ios:fixed)<<setprecision(2)<<WeightWholeTimei<<" "cout<<endl;cout<<"平均周轉(zhuǎn)時(shí)間為："<<Average_WT<<endl;cout<<"平均帶權(quán)周轉(zhuǎn)時(shí)間為:"<<Average_WWT<<endl;DestroyQueue(Q);Status InitQueue(Link

12、Queue &Q)Q.front=Q.rear=(QueuePtr)malloc(sizeof(QNode);if(!Q.front)exit(OVERFLOW);Q.front->next=NULL;return OK;Status DestroyQueue(LinkQueue &Q)while(Q.front)Q.rear=Q.front->next;free(Q.front);Q.front=Q.rear;return OK;Status EnQueue(LinkQueue &Q,QElemType e) QueuePtrp=(QueuePtr)malloc(sizeof(QNode);if(!p) exit(OVERFLOW);p->data=e;p->next=NULL;Q.rear->next=p;Q.rear=p;return OK;int DeQueue(LinkQueue &Q,QElemType e)QueuePtr p;if(Q.front=Q.rear) return ERROR;p=Q.front->next;e=p->data;Q.front->next=p->next;if(Q.rear=p) Q.rear=Q.front;fre