.wd.xx大學(xué)操作系統(tǒng)實(shí)驗(yàn)報(bào)告姓名：學(xué)號(hào)：班級(jí)：實(shí)驗(yàn)日期：實(shí)驗(yàn)名稱：時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法實(shí)驗(yàn)二時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法1. 實(shí)驗(yàn)?zāi)康模?通過這次實(shí)驗(yàn)，理解時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法的運(yùn)行原理，進(jìn)一步掌握進(jìn)程狀態(tài)的轉(zhuǎn)變、進(jìn)程調(diào)度的策略及對(duì)系統(tǒng)性能的評(píng)價(jià)方法。2. 需求分析(1) 輸入的形式和輸入值的范圍；輸入：進(jìn)程個(gè)數(shù)n 范圍：0<n<=100 時(shí)間片q 依次輸入進(jìn)程名進(jìn)程到達(dá)時(shí)間進(jìn)程服務(wù)時(shí)間(2) 輸出的形式進(jìn)程名到達(dá)時(shí)間服務(wù)時(shí)間完成時(shí)間周轉(zhuǎn)時(shí)間帶權(quán)周轉(zhuǎn)時(shí)間所有進(jìn)程平均周轉(zhuǎn)時(shí)間：所有進(jìn)程平均帶權(quán)周轉(zhuǎn)時(shí)間：(3) 程序所能到達(dá)的功能1） 進(jìn)程個(gè)數(shù)n，輸入時(shí)間片大小q，每個(gè)進(jìn)程的到達(dá)時(shí)間T1, ,Tn和服務(wù)時(shí)間S1, ,Sn。2要求時(shí)間片輪轉(zhuǎn)法RR調(diào)度進(jìn)程運(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)；4輸出：輸出計(jì)算出來的每個(gè)進(jìn)程的周轉(zhuǎn)時(shí)間、帶權(quán)周轉(zhuǎn)時(shí)間、所有進(jìn)程的平均周轉(zhuǎn)時(shí)間以及帶權(quán)平均周轉(zhuǎn)時(shí)間。(4) 測(cè)試數(shù)據(jù)，包括正確的輸入及其輸出結(jié)果和含有錯(cuò)誤的輸入及其輸出結(jié)果。正確輸入：錯(cuò)誤輸入：2、概要設(shè)計(jì)所有抽象數(shù)據(jù)類型的定義：static int MaxNum=100int ArrivalTime/到達(dá)時(shí)間 int ServiceTime/服務(wù)時(shí)間 int FinishedTime/完畢時(shí)間 int WholeTime/周轉(zhuǎn)時(shí)間 double WeightWholeTime/帶權(quán)周轉(zhuǎn)時(shí)間double AverageWT /平均周轉(zhuǎn)時(shí)間double AverageWWT /平均帶權(quán)周轉(zhuǎn)時(shí)間主程序的流程:l 變量初始化l 承受用戶輸入的n，q ，T1.Tn,S1.Sn;l 進(jìn)展進(jìn)程調(diào)度，計(jì)算進(jìn)程的開場(chǎng)運(yùn)行時(shí)間、完畢時(shí)間、執(zhí)行順序、周轉(zhuǎn)時(shí)間、帶權(quán)周轉(zhuǎn)時(shí)間；l 計(jì)算所有進(jìn)程的平均周轉(zhuǎn)時(shí)間、平均帶權(quán)周轉(zhuǎn)時(shí)間；l 按照格式輸出調(diào)度結(jié)果。各程序模塊之間的層次(調(diào)用)關(guān)系Main函數(shù)通過對(duì)Input函數(shù)進(jìn)展調(diào)用，對(duì)函數(shù)的成員變量進(jìn)展賦值，再通過RRAlgorithm函數(shù)求出題目要求的各個(gè)數(shù)據(jù)結(jié)果，最后通過display函數(shù)對(duì)結(jié)果進(jìn)展格式輸出。3、詳細(xì)設(shè)計(jì)實(shí)現(xiàn)程序模塊的具體算法。void RRAlgorithm() char processMoment100; /存儲(chǔ)每個(gè)時(shí)間片p對(duì)應(yīng)的進(jìn)程名稱 RRqueue.push(RRarray0); int processMomentPoint = 0; int CurrentTime=0; int tempTime; /聲明此變量控制CurrentTime的累加時(shí)間，當(dāng)前進(jìn)程的服務(wù)時(shí)間小于時(shí)間片q的時(shí)候，起到重要作用 int i=1; /指向還未處理的進(jìn)程的下標(biāo) int finalProcessNumber = 0; /執(zhí)行RR算法后，進(jìn)程的個(gè)數(shù) int processTime50; /CurrentTime的初始化 if (RRarray0.ServiceTime>=q) CurrentTime = q; else CurrentTime = RRarray0.ServiceTime; while(!RRqueue.empty() for (int j=i;j<n;j+) /使得滿足進(jìn)程的到達(dá)時(shí)間小于當(dāng)前時(shí)間的進(jìn)程都進(jìn)入隊(duì)列 if (RRarrayj.name!=NULL && CurrentTime >= RRarrayj.ArrivalTime) RRqueue.push(RRarrayj); i+; if (RRqueue.front().ServiceTime<q) tempTime = RRqueue.front().ServiceTime; else tempTime = q; RRqueue.front().ServiceTime -= q; /進(jìn)程每執(zhí)行一次，就將其服務(wù)時(shí)間 -q /將隊(duì)首進(jìn)程的名稱放入數(shù)組中 processMomentprocessMomentPoint = RRqueue.front().name; processMomentPoint+; processTimefinalProcessNumber = tempTime; finalProcessNumber+; if (RRqueue.front().ServiceTime <= 0) /把執(zhí)行完的進(jìn)程退出隊(duì)列 /RRqueue.front().FinishedTime = CurrentTime; RRqueue.pop(); /如果進(jìn)程的服務(wù)時(shí)間小于等于，即該進(jìn)程已經(jīng)服務(wù)完了，將其退棧 else /將隊(duì)首移到隊(duì)尾 RRqueue.push(RRqueue.front(); RRqueue.pop(); CurrentTime += tempTime; /進(jìn)程輸出處理 每個(gè)時(shí)間段對(duì)應(yīng)的執(zhí)行的進(jìn)程 cout<<"各進(jìn)程的執(zhí)行時(shí)刻信息："<<endl; cout<<" "<<"0時(shí)刻 -> "<<setw(2)<<processTime0<<"時(shí)刻" processTimefinalProcessNumber=0; int time = processTime0; int count = 0; for (i=0;i<finalProcessNumber;i+) count = 0; cout<<setw(3)<<processMomenti<<setw(3)<<endl; while(RRarraycount.name!=processMomenti && count<n) count+; RRarraycount.FinishedTime = time; if (i<finalProcessNumber - 1) cout<<setw(3)<<time<<"時(shí)刻"<<" -> "<<setw(2)<<time + processTimei+1<<"時(shí)刻"<<setw(3); time += processTimei+1; cout<<endl; /周轉(zhuǎn)時(shí)間、帶權(quán)周轉(zhuǎn)時(shí)間、平均周轉(zhuǎn)時(shí)間、帶權(quán)平均周轉(zhuǎn)時(shí)間的計(jì)算 /1. 周轉(zhuǎn)時(shí)間 = 完成時(shí)間 - 到達(dá)時(shí)間 /2. 帶權(quán)周轉(zhuǎn)時(shí)間 = 周轉(zhuǎn)時(shí)間/服務(wù)時(shí)間 for ( i=0;i<n;i+) RRarrayi.WholeTime = RRarrayi.FinishedTime - RRarrayi.ArrivalTime; RRarrayi.WeightWholeTime = (double)RRarrayi.WholeTime/RRarrayi.ServiceTime; double x=0,y=0; for (i=0;i<n;i+) x += RRarrayi.WholeTime; y += RRarrayi.WeightWholeTime; AverageWT = x/n; AverageWWT = y/n; 4、調(diào)試分析1調(diào)試過程中遇到的問題以及解決方法，設(shè)計(jì)與實(shí)現(xiàn)的回憶討論和分析 在算法設(shè)計(jì)時(shí)，由于一開場(chǎng)不知道若何將位于隊(duì)首的進(jìn)程，在執(zhí)行完后若何移至隊(duì)尾進(jìn)展循環(huán)，所以思考了很久，后來想到將隊(duì)首進(jìn)程進(jìn)展重新壓入隊(duì)列從而解決了此問題。2算法的性能分析每個(gè)進(jìn)程被分配一個(gè)時(shí)間段，即該進(jìn)程允許運(yùn)行的時(shí)間。如果在時(shí)間片完畢時(shí)進(jìn)程還在運(yùn)行，那么CPU將被剝奪并分配給另一個(gè)進(jìn)程。如果進(jìn)程在時(shí)間片完畢前阻塞或完畢，那么CPU當(dāng)即進(jìn)展切換。調(diào)度程序所要做的就是維護(hù)一張就緒進(jìn)程列表，當(dāng)進(jìn)程用完它的時(shí)間片后，它被移到隊(duì)列的末尾。3經(jīng)歷體會(huì)通過本次實(shí)驗(yàn)，深入理解了時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法的思想，培養(yǎng)了自己的動(dòng)手能力，通過實(shí)踐加深了記憶。5、用戶使用說明程序的使用說明，列出每一步的操作步驟。輸入進(jìn)程個(gè)數(shù)和時(shí)間篇長(zhǎng)度開場(chǎng)進(jìn)程運(yùn)行時(shí)間-時(shí)間片時(shí)間運(yùn)行隊(duì)首進(jìn)程按到達(dá)時(shí)間從小到大次序輸入進(jìn)程名，到達(dá)時(shí)間和預(yù)計(jì)服務(wù)時(shí)間運(yùn)行時(shí)間=0Y運(yùn)行完成，將進(jìn)程從隊(duì)列中取出中短進(jìn)程，進(jìn)程調(diào)至隊(duì)列尾部N輸出結(jié)果完畢7、附錄帶注釋的源程序，注釋應(yīng)清楚具體#include <iostream> #include <queue> #include <iomanip> #include <fstream> #define MaxNum 100 using namespace std; typedef struct char name; int ArrivalTime; int ServiceTime; int FinishedTime; int WholeTime; double WeightWholeTime; RR; static queue<RR>RRqueue; /聲明一個(gè)隊(duì)列 static double AverageWT =0,AverageWWT=0; static int q; /時(shí)間片 static int n; /進(jìn)程個(gè)數(shù) static RR RRarrayMaxNum; /進(jìn)程構(gòu)造 void Input() /文件讀取模式 ifstream inData; inData.open("./data4.txt"); /data.txt表示q = 4的RR調(diào)度算法 /data2.txt表示q = 1的RR調(diào)度算法 inData>>n; inData>>q; for (int i=0;i<n;i+) inData>>RRarrayi.name; for (i=0;i<n;i+) inData>>RRarrayi.ArrivalTime; for (i=0;i<n;i+) inData>>RRarrayi.ServiceTime; /用戶輸入模式 cout<<"*"<<endl; cout<<"請(qǐng)輸入進(jìn)程個(gè)數(shù) n ： " cin>>n; cout<<"請(qǐng)輸入時(shí)間片 q ： " cin>>q; cout<<"請(qǐng)按到達(dá)時(shí)間的順序依次輸入進(jìn)程名:"<<endl; for (i=0;i<n;i+) cin>>RRarrayi.name; cout<<"請(qǐng)從小到大輸入進(jìn)程到達(dá)時(shí)間:"<<endl; for (i=0;i<n;i+) cin>>RRarrayi.ArrivalTime; cout<<"請(qǐng)按到達(dá)時(shí)間的順序依次輸入進(jìn)程服務(wù)時(shí)間:"<<endl; for (i=0;i<n;i+) cin>>RRarrayi.ServiceTime; cout<<"*"<<endl; /輸出用戶所輸入的信息 cout<<"The information of processes is the following:"<<endl; cout<<setw(10)<<"進(jìn)程名"<<" " cout<<setw(10)<<"到達(dá)時(shí)間"<<" " cout<<setw(10)<<"服務(wù)時(shí)間"<<" "<<endl; for ( i=0;i<n;i+) cout<<setw(10)<<RRarrayi.name<<" " cout<<setw(10)<<RRarrayi.ArrivalTime<<" " cout<<setw(10)<<RRarrayi.ServiceTime<<" "<<endl; cout<<"*"<<endl; void RRAlgorithm() char processMoment100; /存儲(chǔ)每個(gè)時(shí)間片p對(duì)應(yīng)的進(jìn)程名稱 RRqueue.push(RRarray0); int processMomentPoint = 0; int CurrentTime=0; int tempTime; /聲明此變量控制CurrentTime的累加時(shí)間，當(dāng)前進(jìn)程的服務(wù)時(shí)間小于時(shí)間片q的時(shí)候，起到重要作用 int i=1; /指向還未處理的進(jìn)程的下標(biāo) int finalProcessNumber = 0; /執(zhí)行RR算法后，進(jìn)程的個(gè)數(shù) int processTime50; /CurrentTime的初始化 if (RRarray0.ServiceTime>=q) CurrentTime = q; else CurrentTime = RRarray0.ServiceTime; while(!RRqueue.empty() for (int j=i;j<n;j+) /使得滿足進(jìn)程的到達(dá)時(shí)間小于當(dāng)前時(shí)間的進(jìn)程都進(jìn)入隊(duì)列 if (RRarrayj.name!=NULL && CurrentTime >= RRarrayj.ArrivalTime) RRqueue.push(RRarrayj); i+; if (RRqueue.front().ServiceTime<q) tempTime = RRqueue.front().ServiceTime; else tempTime = q; RRqueue.front().ServiceTime -= q; /進(jìn)程每執(zhí)行一次，就將其服務(wù)時(shí)間 -q /將隊(duì)首進(jìn)程的名稱放入數(shù)組中 processMomentprocessMomentPoint = RRqueue.front().name; processMomentPoint+; processTimefinalProcessNumber = tempTime; finalProcessNumber+; if (RRqueue.front().ServiceTime <= 0) /把執(zhí)行完的進(jìn)程退出隊(duì)列 /RRqueue.front().FinishedTime = CurrentTime; RRqueue.pop(); /如果進(jìn)程的服務(wù)時(shí)間小于等于，即該進(jìn)程已經(jīng)服務(wù)完了，將其退棧 else /將隊(duì)首移到隊(duì)尾 RRqueue.push(RRqueue.front(); RRqueue.pop(); CurrentTime += tempTime; /進(jìn)程輸出處理 每個(gè)時(shí)間段對(duì)應(yīng)的執(zhí)行的進(jìn)程 cout<<"各進(jìn)程的執(zhí)行時(shí)刻信息："<<endl; cout<<" "<<"0時(shí)刻 -> "<<setw(2)<<processTime0<<"時(shí)刻" processTimefinalProcessNumber=0; int time = processTime0; int count = 0; for (i=0;i<finalProcessNumber;i+) count = 0; cout<<setw(3)<<processMomenti<<setw(3)<<endl; while(RRarraycount.name!=processMomenti && count<n) count+; RRarraycount.FinishedTime = time; if (i<finalProcessNumber - 1) cout<<setw(3)<<time<<"時(shí)刻"<<" -> "<<setw(2)<<time + processTimei+1<<"時(shí)刻"<<setw(3); time += processTimei+1; cout<<endl; /周轉(zhuǎn)時(shí)間、帶權(quán)周轉(zhuǎn)時(shí)間、平均周轉(zhuǎn)時(shí)間、帶權(quán)平均周轉(zhuǎn)時(shí)間的計(jì)算 /1. 周轉(zhuǎn)時(shí)間 = 完成時(shí)間 - 到達(dá)時(shí)間 /2. 帶權(quán)周轉(zhuǎn)時(shí)間 = 周轉(zhuǎn)時(shí)間/服務(wù)時(shí)間 for ( i=0;i<n;i+) RRarrayi.WholeTime = RRarrayi.FinishedTime - RRarrayi.ArrivalTime; RRarrayi.WeightWholeTime = (double)RRarrayi.WholeTime/RRarrayi.ServiceTime; double x=0,y=0; for (i=0;i<n;i+) x += RRarrayi.WholeTime; y += RRarrayi.WeightWholeTime; AverageWT = x/n; AverageWWT = y/n; void display() cout<<"*"<<endl; cout<<"RR調(diào)度算法執(zhí)行后：進(jìn)程相關(guān)信息如下："<<endl; cout<<setw(10)<<"進(jìn)程名ID"<<" " cout<<setw(10)<<"到達(dá)時(shí)間"<<" " cout<<setw(10)<<"服務(wù)時(shí)間"<<" " cout<<setw(10)<<"完成時(shí)間"<<" " cout<<setw(10)<<"周轉(zhuǎn)時(shí)間"<<" " cout<<setw(10)<<"帶權(quán)周轉(zhuǎn)時(shí)間"<<endl; for (int i = 0;i<n;i+) cout<<setw(10)<<RRarrayi.name<<" " cout<<setw(10)<<RRarrayi.ArrivalTime<<" " cout<<setw(10)<<RRarrayi.ServiceTime<<" " cout<<setw(10)<<RRarrayi.FinishedTime<<" " cout<<setw(10)<<RRarrayi.WholeTime<<" " cout<<setw(10)<<RRarrayi.WeightWholeTime<<" "<<endl; cout<<"所有進(jìn)程的平均周轉(zhuǎn)時(shí)間 = "<<AverageWT<<endl; cout<<"所有進(jìn)程的平均帶權(quán)周轉(zhuǎn)時(shí)間 = "<<AverageWWT<<endl; cout<<"*"<<endl; int main() Input(); RRAlgorithm(); display(); return 0;