《時(shí)間片輪轉(zhuǎn)調(diào)度算法實(shí)驗(yàn)報(bào)告》由會(huì)員分享，可在線閱讀，更多相關(guān)《時(shí)間片輪轉(zhuǎn)調(diào)度算法實(shí)驗(yàn)報(bào)告（10頁(yè)珍藏版）》請(qǐng)?jiān)谘b配圖網(wǎng)上搜索。

1、 .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)康模?通過(guò)這次實(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 范圍：0n=q) CurrentTime = q; else CurrentTime = RRarray0.ServiceTime; while(!RRqueue.empty() for (int j=i;j= RRarrayj.ArrivalTime) RRque

2、ue.push(RRarrayj); i+; if (RRqueue.front().ServiceTimeq) 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 = tempTi

3、me; 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 se

4、tw(2)processTime0時(shí)刻; processTimefinalProcessNumber=0; int time = processTime0; int count = 0; for (i=0;ifinalProcessNumber;i+) count = 0; coutsetw(3)processMomentisetw(3)endl; while(RRarraycount.name!=processMomenti & countn) count+; RRarraycount.FinishedTime = time; if (ifinalProcessNumber - 1) cou

5、tsetw(3)time時(shí)刻 setw(2)time + processTimei+1時(shí)刻setw(3); time += processTimei+1; coutendl; /周轉(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;in;i+) RRarrayi.WholeTime = RRarrayi.FinishedTime - RRarrayi.ArrivalTime; RRarrayi.WeightWholeTime = (double)RRarrayi.WholeT

6、ime/RRarrayi.ServiceTime; double x=0,y=0; for (i=0;in;i+) x += RRarrayi.WholeTime; y += RRarrayi.WeightWholeTime; AverageWT = x/n; AverageWWT = y/n; 4、調(diào)試分析1調(diào)試過(guò)程中遇到的問(wèn)題以及解決方法，設(shè)計(jì)與實(shí)現(xiàn)的回憶討論和分析 在算法設(shè)計(jì)時(shí)，由于一開(kāi)場(chǎng)不知道若何將位于隊(duì)首的進(jìn)程，在執(zhí)行完后若何移至隊(duì)尾進(jìn)展循環(huán)，所以思考了很久，后來(lái)想到將隊(duì)首進(jìn)程進(jìn)展重新壓入隊(duì)列從而解決了此問(wèn)題。2算法的性能分析每個(gè)進(jìn)程被分配一個(gè)時(shí)間段，即該進(jìn)程允許運(yùn)行的時(shí)間。如果在時(shí)

7、間片完畢時(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ì)通過(guò)本次實(shí)驗(yàn)，深入理解了時(shí)間片輪轉(zhuǎn)RR進(jìn)程調(diào)度算法的思想，培養(yǎng)了自己的動(dòng)手能力，通過(guò)實(shí)踐加深了記憶。5、用戶使用說(shuō)明程序的使用說(shuō)明，列出每一步的操作步驟。輸入進(jìn)程個(gè)數(shù)和時(shí)間篇長(zhǎng)度開(kāi)場(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、附錄帶注釋的源程序，注釋

8、應(yīng)清楚具體#include #include #include #include #define MaxNum 100 using namespace std; typedef struct char name; int ArrivalTime; int ServiceTime; int FinishedTime; int WholeTime; double WeightWholeTime; RR; static queueRRqueue; /聲明一個(gè)隊(duì)列 static double AverageWT =0,AverageWWT=0; static int q; /時(shí)間片 static in

9、t 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)度算法 inDatan; inDataq; for (int i=0;iRRarrayi.name; for (i=0;iRRarrayi.ArrivalTime; for (i=0;iRRarrayi.ServiceTime; /用戶輸入模式 cout*endl; coutn; coutq; c

10、out請(qǐng)按到達(dá)時(shí)間的順序依次輸入進(jìn)程名:endl; for (i=0;iRRarrayi.name; cout請(qǐng)從小到大輸入進(jìn)程到達(dá)時(shí)間:endl; for (i=0;iRRarrayi.ArrivalTime; cout請(qǐng)按到達(dá)時(shí)間的順序依次輸入進(jìn)程服務(wù)時(shí)間:endl; for (i=0;iRRarrayi.ServiceTime; cout*endl; /輸出用戶所輸入的信息 coutThe information of processes is the following:endl; coutsetw(10)進(jìn)程名 ; coutsetw(10)到達(dá)時(shí)間 ; coutsetw(10)服務(wù)時(shí)

11、間 endl; for ( i=0;in;i+) coutsetw(10)RRarrayi.name ; coutsetw(10)RRarrayi.ArrivalTime ; coutsetw(10)RRarrayi.ServiceTime endl; cout*=q) CurrentTime = q; else CurrentTime = RRarray0.ServiceTime; while(!RRqueue.empty() for (int j=i;j= RRarrayj.ArrivalTime) RRqueue.push(RRarrayj); i+; if (RRqueue.front

12、().ServiceTimeq) 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.fro

13、nt().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 setw(2)processTime0時(shí)刻; processTimefinalPro

14、cessNumber=0; int time = processTime0; int count = 0; for (i=0;ifinalProcessNumber;i+) count = 0; coutsetw(3)processMomentisetw(3)endl; while(RRarraycount.name!=processMomenti & countn) count+; RRarraycount.FinishedTime = time; if (ifinalProcessNumber - 1) coutsetw(3)time時(shí)刻 setw(2)time + processTime

15、i+1時(shí)刻setw(3); time += processTimei+1; coutendl; /周轉(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;in;i+) RRarrayi.WholeTime = RRarrayi.FinishedTime - RRarrayi.ArrivalTime; RRarrayi.WeightWholeTime = (double)RRarrayi.WholeTime/RRarrayi.ServiceTime; double x=0,y=0

16、; for (i=0;in;i+) x += RRarrayi.WholeTime; y += RRarrayi.WeightWholeTime; AverageWT = x/n; AverageWWT = y/n; void display() cout*endl; coutRR調(diào)度算法執(zhí)行后：進(jìn)程相關(guān)信息如下：endl; coutsetw(10)進(jìn)程名ID ; coutsetw(10)到達(dá)時(shí)間 ; coutsetw(10)服務(wù)時(shí)間 ; coutsetw(10)完成時(shí)間 ; coutsetw(10)周轉(zhuǎn)時(shí)間 ; coutsetw(10)帶權(quán)周轉(zhuǎn)時(shí)間endl; for (int i = 0;i

17、n;i+) coutsetw(10)RRarrayi.name ; coutsetw(10)RRarrayi.ArrivalTime ; coutsetw(10)RRarrayi.ServiceTime ; coutsetw(10)RRarrayi.FinishedTime ; coutsetw(10)RRarrayi.WholeTime ; coutsetw(10)RRarrayi.WeightWholeTime endl; cout所有進(jìn)程的平均周轉(zhuǎn)時(shí)間 = AverageWTendl; cout所有進(jìn)程的平均帶權(quán)周轉(zhuǎn)時(shí)間 = AverageWWTendl; cout*endl; int main() Input(); RRAlgorithm(); display(); return 0;