操作系統(tǒng)作業(yè)調度實驗報告

昆明理工大學信息工程與自動化學院學生實驗報告（2011—2012學年第二學期）課程名稱：操作系統(tǒng)開課實驗室：信自樓2012年4月10日年級、專業(yè)、班計科103學號201010405318姓名李波成績實驗項目名稱作業(yè)調度指導教師舒國鋒教師評語教師簽名：年月日一、實驗目的通過編寫進程管理的算法，要求學生掌握整個進程管理的各個環(huán)節(jié)，進程的數(shù)據(jù)結構描述，進程的各種狀態(tài)之間的轉換，以及進程的調度算法。以加深對進程的概念及進程調度算法的理解，并且提高鏈表的應用能力，達到提高編程能力的目的。二、所用儀器、材料（設備名稱、型號、規(guī)格等）。計算機一臺，VC++6.0。三、源程序：#include<iostream>#include<cstdlib>#include"assert.h"usingnamespacestd;classJob{public: intm_runtime;//作業(yè)運行時間intm_level;//優(yōu)先級 intm_arrivenum;//作業(yè)到達次序 intm_start;//作業(yè)開始時間 intm_end;//作業(yè)結束時間 Job*m_next;//指向下一個結點public: Job() { m_next=NULL; m_runtime=0; m_level=0; m_arrivenum=0; m_start=0; m_end=0; } ~Job() { }};classJobList{public: JobList() { Head=newJob; assert(Head); length=0; intnum,runtime,level,arrivenum; Job*pt,*st; st=Head; cout<<"請輸入作業(yè)個數(shù)："; cin>>num; while(length<num) { pt=newJob; assert(pt); cout<<"請輸入第"<<length+1<<"個作業(yè)的運行時間，優(yōu)先級，到達次序"<<endl; cin>>runtime>>level>>arrivenum; pt->m_runtime=runtime; pt->m_level=level; pt->m_arrivenum=arrivenum; st->m_next=pt; st=pt; length++; } } ~JobList()//由于Job類調用自己的析構函數(shù)，故而此處不需要操作 { } Job*GetHead() { returnHead; } intGetLength() { returnlength; }private: Job*Head; intlength;};voidFCFS(JobListjoblist){ inttimetag=0,i=0; Job*pt; while(i<joblist.GetLength()) { pt=joblist.GetHead()->m_next;//頭結點不用 while(pt->m_arrivenum!=i) { pt=pt->m_next; } pt->m_start=timetag; timetag+=pt->m_runtime; pt->m_end=timetag; i++;//下一作業(yè) } intovertime=0; pt=joblist.GetHead()->m_next; while(pt!=NULL) { overtime+=(pt->m_end-pt->m_arrivenum); pt=pt->m_next; } cout<<"FCFS的平均作業(yè)周轉時間為："<<(double)overtime/joblist.GetLength()<<endl;}voidSJF(JobListjoblist){ inttag,i=0,timetag=0; Job*pt,*st; pt=joblist.GetHead()->m_next; //pt->m_start=timetag; timetag+=pt->m_runtime; pt->m_end=timetag; pt->m_runtime=100; while(i<(joblist.GetLength()-1)) { st=pt->m_next; tag=100; while(st)//找到最小 { if(st->m_runtime<tag) tag=st->m_runtime; st=st->m_next; } st=pt->m_next; while(st->m_runtime!=tag) st=st->m_next; st->m_start=timetag; timetag+=st->m_runtime; st->m_end=timetag; st->m_runtime=100;//重新標記 i++;//下一作業(yè) } intovertime=0; while(pt) { overtime+=(pt->m_end);//-pt->m_arrivenum); pt=pt->m_next; } cout<<"SJF的平均周轉時間為："<<(double)overtime/joblist.GetLength()<<endl;}voidRR(JobListjoblist){ Job*pt; inttimetag=0,remaintime=0; booltag=true;pt=joblist.GetHead()->m_next; while(pt) { remaintime+=pt->m_runtime; pt=pt->m_next; } while(tag) { pt=joblist.GetHead()->m_next; while(pt) { if(pt->m_runtime==0) pt=pt->m_next; else { timetag+=2; pt->m_runtime-=2; remaintime-=2; if(pt->m_runtime<0)//作業(yè)結束自行退出 { pt->m_runtime=0; timetag--; } if(pt->m_runtime==0) pt->m_end=timetag; pt=pt->m_next; } } if(remaintime==0) tag=false; } pt=joblist.GetHead()->m_next; intovertime=0; while(pt) { overtime+=pt->m_end; pt=pt->m_next; } cout<<"RR的平均周轉時間為："<<(double)overtime/joblist.GetLength()<<endl;}voidHLF(JobListjoblist)//優(yōu)先級算法{ inttimetag=0,i=0,leveltag; Job*pt; while(i<joblist.GetLength()) { leveltag=0; pt=joblist.GetHead()->m_next; while(pt)//找到最高優(yōu)先級別的 { if(pt->m_level>leveltag) leveltag=pt->m_level; pt=pt->m_next; } pt=joblist.GetHead()->m_next; while(pt->m_level!=leveltag) { pt=pt->m_next; } pt->m_start=timetag; timetag+=pt->m_runtime; pt->m_end=timetag; pt->m_level=0; i++; }pt=joblist.GetHead()->m_next; intovertime=0; while(pt) { overtime+=pt->m_end; pt=pt->m_next; } cout<<"HLF的平均作業(yè)周轉時間為："<<(double)overtime/joblist.GetLength()<<endl;}voidmain(){ intchoice; cout<<"請選擇調度算法"<<endl<<"0_退出程序"<<endl<<"1_先來先服務"<<endl<<"2_優(yōu)先數(shù)算法" <<endl<<"3_短作業(yè)優(yōu)先算法"<<endl<<"4_時間片輪轉算法"<<endl; cin>>choice; while(choice!=0) { switch(choice) { case1: { cout<<"建立作業(yè)"<<endl; JobListmyjoblist; FCFS(myjoblist); break; } case2: { cout<<"建立作業(yè)"<<endl; JobListmyjoblist; HLF(myjoblist); break; } case3: { cout<<"建立作業(yè)"<<endl; JobListmyjoblist; SJF(myjoblist); break; } case4: { cout<<"建立作業(yè)"<<endl; JobListmyjoblist; RR(myjoblist); break; } } cout<<"請選擇調度算法"<<endl<<"0_退出程序"<<endl<<"1_先來先服務"<<endl<<"2_優(yōu)先數(shù)算法" <<endl<<"3_短作業(yè)優(yōu)先算法"<<endl<<"4_時間片輪轉算法"<<endl; cin>>choice; } //FCFS(joblist); //HLF(joblist); //SJF(joblist); //RR(joblist);}四、程序截圖：五、實驗結果、分析和結論（誤差分析與數(shù)據(jù)處理、成果總結等。其中，繪制曲線圖時必須用計算紙）操作系統(tǒng)是計算機系統(tǒng)中必不可少的系統(tǒng)軟件，它是計算機系統(tǒng)中各種資源的管理者和各種活動的組織者、指揮者。操作系統(tǒng)采用時間片法調度進程，使系統(tǒng)資源得到充分利用，用戶可以花更少的時