各類作業(yè)調(diào)度算法

1、實(shí)驗(yàn)二 作業(yè)調(diào)度實(shí)驗(yàn)一. 目的要求：  用高級(jí)語言編寫和調(diào)試一個(gè)或多個(gè)作業(yè)調(diào)度的模擬程序，以加深對(duì)作業(yè)調(diào)度算法的理解。  二. 例題：為單道批處理系統(tǒng)設(shè)計(jì)一個(gè)作業(yè)調(diào)度程序。  由于在單道批處理系統(tǒng)中，作業(yè)一投入運(yùn)行，它就占有計(jì)算機(jī)的一切資源直到作業(yè)完成為止，因此調(diào)度作業(yè)時(shí)不必考慮它所需要的資源是否得到滿足，它所占用的 CPU時(shí)限等因素。 作業(yè)調(diào)度算法：采用先來先服務(wù)（FCFS）調(diào)度算法，即按作業(yè)提交的先后次序進(jìn)行調(diào)度?？偸鞘紫日{(diào)度在系統(tǒng)中等待時(shí)間最長(zhǎng)的作業(yè)。 每個(gè)作業(yè)由一個(gè)作業(yè)控制塊JCB表示，JCB可以包含如下信息：作業(yè)名、提交時(shí)間、所需的運(yùn)行時(shí)間、所需的資源、

2、作業(yè)狀態(tài)、鏈指針等等。 作業(yè)的狀態(tài)可以是等待W(Wait)、運(yùn)行R(Run)和完成F(Finish)三種狀態(tài)之一。每個(gè)作業(yè)的最初狀態(tài)總是等待W。 各個(gè)等待的作業(yè)按照提交時(shí)刻的先后次序排隊(duì)，總是首先調(diào)度等待隊(duì)列中隊(duì)首的作業(yè)。 每個(gè)作業(yè)完成后要打印該作業(yè)的開始運(yùn)行時(shí)刻、完成時(shí)刻、周轉(zhuǎn)時(shí)間和帶權(quán)周轉(zhuǎn)時(shí)間，這一組作業(yè)完成后要計(jì)算并打印這組作業(yè)的平均周轉(zhuǎn)時(shí)間、帶權(quán)平均周轉(zhuǎn)時(shí)間。 調(diào)度算法的流程圖如下圖所示。三 . 實(shí)習(xí)題： 1、編寫并調(diào)試一個(gè)單道處理系統(tǒng)的作業(yè)等待模擬程序。 作業(yè)等待算法：分別采用先來先服務(wù)（FCFS），最短作業(yè)優(yōu)先（SJF）、響應(yīng)比高者優(yōu)先（HRN）的調(diào)度算法。 對(duì)每種調(diào)度算法都要求打

3、印每個(gè)作業(yè)開始運(yùn)行時(shí)刻、完成時(shí)刻、周轉(zhuǎn)時(shí)間、帶權(quán)周轉(zhuǎn)時(shí)間，以及這組作業(yè)的平均周轉(zhuǎn)時(shí)間及帶權(quán)平均周轉(zhuǎn)時(shí)間，以比較各種算法的優(yōu)缺點(diǎn)。  2、編寫并調(diào)度一個(gè)多道程序系統(tǒng)的作業(yè)調(diào)度模擬程序。 作業(yè)調(diào)度算法：采用基于先來先服務(wù)的調(diào)度算法?？梢詤⒖颊n本中的方法進(jìn)行設(shè)計(jì)。 對(duì)于多道程序系統(tǒng)，要假定系統(tǒng)中具有的各種資源及數(shù)量、調(diào)度作業(yè)時(shí)必須考慮到每個(gè)作業(yè)的資源要求。  3、編寫并調(diào)試一個(gè)多道程序系統(tǒng)的作業(yè)調(diào)度模擬程序。 作業(yè)調(diào)度算法：采用基于優(yōu)先級(jí)的作業(yè)調(diào)度。 可以參考課本中的例子自行設(shè)計(jì)。 三 . 實(shí)驗(yàn)過程：1、編寫并調(diào)試一個(gè)單道處理系統(tǒng)的作業(yè)等待模擬程序。先來先服務(wù)（FCFS）：mai

4、n.cpp:/*先來先服作業(yè)調(diào)度算法模擬*/#include <string>#include <iostream>#define MAX_SOURCE 1000 /資源總數(shù)（對(duì)于單通道的作業(yè)調(diào)度可以忽略系統(tǒng)資源問題）using namespace std;struct jobCB string name; double subtime;/提交時(shí)間 double runtime;/運(yùn)行時(shí)間 double source;/資源 char state;/進(jìn)程狀態(tài) struct jobCB *next; /鏈指針*ready,*rail,*p;int length;doubl

5、e maxsource;double now_source;double allTi;/總周轉(zhuǎn)時(shí)間double allWi;/總帶權(quán)周轉(zhuǎn)時(shí)間double time;/時(shí)鐘void init() time=0; length=0; allTi=0; allWi=0; maxsource=MAX_SOURCE; now_source=0; rail=ready=p=NULL;void destroy() maxsource+=p->source;/釋放資源 time+=p->runtime; p->state='f' delete p;void running()

6、 p->state='r' double Tc = time+ p->runtime;/完成時(shí)刻 double Ti = Tc - p->subtime;/周轉(zhuǎn)時(shí)間 double Wi = Ti/p->runtime;/帶權(quán)周轉(zhuǎn)時(shí)間 cout<<"n作業(yè)"<<p->name<<"信息："<<endl; cout<<"n錄入時(shí)間 運(yùn)行時(shí)間 開始運(yùn)行的時(shí)刻 完成時(shí)刻 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間"<<endl; cout<

7、<"n"<<p->subtime<<"t "<<p->runtime<<"t "<<time<<" t"<<Tc<<"t "<<Ti<<" t"<<Wi<<endl; allTi+=Ti; allWi+=Wi; destroy();void display() cout<<"n-"&l

8、t;<endl; for(int i=0; i< length; i+) p = ready; ready = ready->next; p->state = 'r' running(); cout<<"n-"<<endl;void in_queue() now_source+=p->source;/分配資源給作業(yè) if(maxsource>=now_source) if(ready=NULL) ready=rail=p; else rail->next=p; rail=p; length +

9、; else now_source-=p->source;/回退 cout<<"沒有足夠資源！"<<endl; return; void input() int n; cout<<" -先來先服作業(yè)調(diào)度算法模擬-"<<endl; cout<<"請(qǐng)輸入作業(yè)數(shù): "<<endl; cin>>n; for(int i = 0; i < n; i+) p = new jobCB; cout<<"當(dāng)前作業(yè)錄入時(shí)間："&

10、lt;<time; cout<<"n請(qǐng)輸入作業(yè)名: " cin>>p->name; cout<<"n請(qǐng)輸入作業(yè)所需的運(yùn)行時(shí)間: " cin>>p->runtime; cout<<"n請(qǐng)輸入作業(yè)所需的資源: " cin>>p->source; p->state = 'w' p->subtime = time; time+; p->next = NULL; in_queue(); int main() init

11、(); input(); display(); cout<<"n這組作業(yè)的平均周轉(zhuǎn)時(shí)間為: "<<allTi / length<<endl; cout<<"n這組作業(yè)的帶權(quán)平均周轉(zhuǎn)時(shí)間為: "<<allWi / length<<endl; return 0;（程序測(cè)試運(yùn)行結(jié)果在附件里）短作業(yè)優(yōu)先（SJF）:main.cpp:/*短作業(yè)優(yōu)先作業(yè)調(diào)度算法模擬*/#include <string>#include <iostream>#define MAX_SOUR

12、CE 1000using namespace std;struct jobCB string name; double subtime;/提交時(shí)間 double runtime;/運(yùn)行時(shí)間 double source;/資源 char state;/進(jìn)程狀態(tài) struct jobCB *next; /鏈指針*ready,*rail,*p;int length;double maxsource; /資源總數(shù)，對(duì)于單通道作業(yè)調(diào)度，資源部分可以去掉（由于當(dāng)時(shí)寫多道時(shí)是在單道上直接修改的，所以這里多道部分仍然在）double now_source; /當(dāng)前資源double allTi;/總周轉(zhuǎn)時(shí)間do

13、uble allWi;/總帶權(quán)周轉(zhuǎn)時(shí)間double time;/時(shí)鐘void init()time=0;length=0;allTi=0;allWi=0;maxsource=MAX_SOURCE;now_source=0;rail=ready=p=NULL;void destroy() Maxsource+=p->source;/釋放資源 time+=p->runtime; p->state='f' delete p;void running() p->state='r' double Tc = time+ p->runtime;/

14、完成時(shí)刻 double Ti = Tc - p->subtime;/周轉(zhuǎn)時(shí)間 double Wi = Ti/p->runtime;/帶權(quán)周轉(zhuǎn)時(shí)間 cout<<"n作業(yè)"<<p->name<<"信息："<<endl; cout<<"n錄入時(shí)間 運(yùn)行時(shí)間 開始運(yùn)行的時(shí)刻 完成時(shí)刻 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間"<<endl; cout<<"n"<<p->subtime<<"t &quo

15、t;<<p->runtime<<"t "<<time<<" t"<<Tc<<"t "<<Ti<<" t"<<Wi<<endl; allTi+=Ti; allWi+=Wi; destroy();void display() cout<<"n-"<<endl; for(int i=0; i< length; i+) p = ready; read

16、y = ready->next; p->state = 'r' running(); cout<<"n-"<<endl;void in_queue() int flag=0; now_source+=p->source;/分配資源給作業(yè) jobCB *q1,*q2; if(maxsource>=now_source) if(ready=NULL) ready=rail=p; else if(p->runtime<ready->runtime) p->next=ready; ready=p

17、; else q1=ready; q2=ready->next; while(q2!=NULL) if(q2->runtime>p->runtime) p->next=q2; q1->next=p; flag=1; q1=q2; q2=q2->next; if(flag=0) q1->next=p; length +; else now_source-=p->source;/回退 cout<<"沒有足夠資源！"<<endl; return; void input() int n; cout<

18、<" -短作業(yè)優(yōu)先作業(yè)調(diào)度算法模擬-"<<endl; cout<<"請(qǐng)輸入作業(yè)數(shù): "<<endl; cin>>n; for(int i = 0; i < n; i+) p = new jobCB; cout<<"當(dāng)前作業(yè)錄入時(shí)間："<<time; cout<<"n請(qǐng)輸入作業(yè)名: " cin>>p->name; cout<<"n請(qǐng)輸入作業(yè)所需的運(yùn)行時(shí)間: " cin>

19、;>p->runtime; cout<<"n請(qǐng)輸入作業(yè)所需的資源: " cin>>p->source; p->state = 'w' p->subtime = time; time+; p->next = NULL; in_queue(); int main() init(); input(); display(); cout<<"n這組作業(yè)的平均周轉(zhuǎn)時(shí)間為: "<<allTi / length<<endl; cout<<"

20、;n這組作業(yè)的帶權(quán)平均周轉(zhuǎn)時(shí)間為: "<<allWi / length<<endl; return 0;（程序測(cè)試運(yùn)行結(jié)果在附件里）響應(yīng)比高者優(yōu)先（HRN）：main.cpp:/*響應(yīng)比高優(yōu)先作業(yè)調(diào)度算法模擬*/#include <string>#include <iostream>#include <list>#define MAX_SOURCE 1000using namespace std;struct jobCB string name; double subtime;/提交時(shí)間 double runtime;/運(yùn)行

21、時(shí)間 double source;/資源 char state;/進(jìn)程狀態(tài) struct jobCB *next; /鏈指針*p;list <jobCB*> jobqueue; /聲明作業(yè)調(diào)度隊(duì)列，使用STL（標(biāo)準(zhǔn)模板庫(kù)）的listlist <jobCB*> :iterator it;int length;double maxsource;double now_source;double allTi;/總周轉(zhuǎn)時(shí)間double allWi;/總帶權(quán)周轉(zhuǎn)時(shí)間double time;/時(shí)鐘double inputfinishtime;/輸入結(jié)束時(shí)間void init() ti

22、me=0; length=0; allTi=0; allWi=0; inputfinishtime=0; maxsource=MAX_SOURCE; now_source=0; p=NULL;void destroy() maxsource+=p->source; time+=p->runtime; p->state='f'void running() p->state='r' double Tc = time+ p->runtime;/完成時(shí)刻 double Ti = Tc - p->subtime;/周轉(zhuǎn)時(shí)間 double

23、 Wi = Ti/p->runtime;/帶權(quán)周轉(zhuǎn)時(shí)間 cout<<"n作業(yè)"<<p->name<<"信息："<<endl; cout<<"n錄入時(shí)間 運(yùn)行時(shí)間 開始運(yùn)行的時(shí)刻 完成時(shí)刻 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間 響應(yīng)比"<<endl; cout<<"n"<<p->subtime<<"t "<<p->runtime<<"t "

24、;<<time<<" t"<<Tc<<"t "<<Ti<<" t"<<Wi<<" t"<<(inputfinishtime-p->subtime)/p->runtime+1<<endl; allTi+=Ti; allWi+=Wi; destroy();void display() cout<<"n-"<<endl; for(int i=0;

25、i< length; i+) p=jobqueue.front();/取出隊(duì)首元素 jobqueue.pop_front();/出隊(duì) p->state = 'r' running(); cout<<"n-"<<endl;void in_queue()/按所有作業(yè)到達(dá)后再計(jì)算響應(yīng)比（即固定優(yōu)先比），所有作業(yè)都提交完成的時(shí)間是n*提交單個(gè)作業(yè)時(shí)間（1） now_source+=p->source;/分配資源給作業(yè) if(maxsource>=now_source) jobqueue.push_back(p); le

26、ngth +; else now_source-=p->source;/回退 cout<<"沒有足夠資源！"<<endl; return; double makeout_ResR(jobCB *p)/算出響應(yīng)比，因?yàn)閮?yōu)先比是waittime/runtime+1，所以這里直接比較waittime/runtime->(inputfinishtime-subtime)/runtime /cout<<(inputfinishtime-p->subtime)/p->runtime<<" t"

27、return (inputfinishtime-p->subtime)/p->runtime;bool compare(jobCB *first,jobCB *second) /用于list排序的compare函數(shù) if(makeout_ResR(first)>makeout_ResR(second) return true; else return false;void input() int n; cout<<" -響應(yīng)比優(yōu)先作業(yè)調(diào)度算法模擬-"<<endl; cout<<"請(qǐng)輸入作業(yè)數(shù): "&l

28、t;<endl; cin>>n; inputfinishtime=n*1; for(int i = 0; i < n; i+) p = new jobCB; cout<<"當(dāng)前作業(yè)錄入時(shí)間："<<time; cout<<"n請(qǐng)輸入作業(yè)名: " cin>>p->name; cout<<"n請(qǐng)輸入作業(yè)所需的運(yùn)行時(shí)間: " cin>>p->runtime; cout<<"n請(qǐng)輸入作業(yè)所需的資源: " c

29、in>>p->source; p->state = 'w' p->subtime = time; time+; p->next = NULL; in_queue(); jobqueue.sort(compare);int main() init(); input(); display(); cout<<"n這組作業(yè)的平均周轉(zhuǎn)時(shí)間為: "<<allTi / length<<endl; cout<<"n這組作業(yè)的帶權(quán)平均周轉(zhuǎn)時(shí)間為: "<<allW

30、i / length<<endl; return 0;（程序測(cè)試運(yùn)行結(jié)果在附件里）2、編寫并調(diào)度一個(gè)多道程序系統(tǒng)的作業(yè)調(diào)度模擬程序。采用基于先來先服務(wù)的調(diào)度算法：（程序源碼在1中已粘貼，1中不需要用到source部分）3、編寫并調(diào)試一個(gè)多道程序系統(tǒng)的作業(yè)調(diào)度模擬程序。 作業(yè)調(diào)度算法：采用基于優(yōu)先級(jí)的作業(yè)調(diào)度。main.cpp:/*短作業(yè)優(yōu)先作業(yè)調(diào)度算法模擬*/#include <string>#include <iostream>#define MAX_SOURCE 1000using namespace std;struct jobCB string na

31、me; double subtime;/提交時(shí)間 double runtime;/運(yùn)行時(shí)間 double source;/資源 int priority;/優(yōu)先級(jí) char state;/進(jìn)程狀態(tài) struct jobCB *next; /鏈指針*ready,*rail,*p;int length;double maxsource;double now_source;double allTi;/總周轉(zhuǎn)時(shí)間double allWi;/總帶權(quán)周轉(zhuǎn)時(shí)間double time;/時(shí)鐘void init() time=0; length=0; allTi=0; allWi=0; maxsource=MA

32、X_SOURCE; now_source=0; rail=ready=p=NULL;void destroy() maxsource+=p->source; time+=p->runtime; p->state='f' delete p;void running() p->state='r' double Tc = time+ p->runtime;/完成時(shí)刻 double Ti = Tc - p->subtime;/周轉(zhuǎn)時(shí)間 double Wi = Ti/p->runtime;/帶權(quán)周轉(zhuǎn)時(shí)間 cout<<&

33、quot;n作業(yè)"<<p->name<<"信息："<<endl; cout<<"n錄入時(shí)間 運(yùn)行時(shí)間 開始運(yùn)行的時(shí)刻 完成時(shí)刻 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間 優(yōu)先級(jí)"<<endl; cout<<"n"<<p->subtime<<"t "<<p->runtime<<"t "<<time<<" t"<<T

34、c<<"t "<<Ti<<" t"<<Wi<<" t"<<p->priority<<endl; allTi+=Ti; allWi+=Wi; destroy();void display() cout<<"n-"<<endl; for(int i=0; i< length; i+) p = ready; ready = ready->next; p->state = 'r' running(); cout<<"n-"<<endl;void in_queue() int flag=0; now_source+=p->source;/分配資源給作業(yè) jobCB *q1,*q2; if(maxsource>=now_source