短作業(yè)優(yōu)先算法試驗報告

實驗短作業(yè)優(yōu)先SJF進程調度算法模擬一、實驗目的模擬單處理器系統(tǒng)的進程調度，采用短作業(yè)優(yōu)先的進程調度算法作為進程設計算法，以加深對進程的概念及進程調度算法的理解．二、實驗內容如進程信息如下：structPCBpcb[N]= {{"AAA",0,4},{"BBB",1,3},{"CCC",2,5},{"DDD",15,2},{"EEE",4,4}};進程名到達時間運行時間完成時間周轉時間A0444B1376C251614D152183E44117#include<stdio.h>#include<string.h>#include<stdlib.h>#include<conio.h>#defineN5structPCB{ charname[8]; intarrive_time; intrun_time; intfinish_time; intzhouzhuan_time; floatdaiquan_time;};floatpinjun_zhouzhuan_time;floatpinjun_daiquan_time;structPCBpcb[N]={{"DDD",3,2},{"AAA",0,4},{"BBB",1,3},{"CCC",2,5},{"EEE",4,4}};voidoutput(){printf("進程名到達時間運行時間完成時間周轉時間帶權周轉時間\n"); for(inti=0;i<N;i++) { printf("%s%d%d%d%d%f\n",pcb[i].name,pcb[i].arrive_time,pcb[i].run_time,pcb[i].finish_time,pcb[i].zhouzhuan_time,pcb[i].daiquan_time); }}voidsortPCB(){ structPCBtemp;inti,j; for(i=0;i<N-1;i++) for(j=i+1;j<N;j++) if(pcb[i].arrive_time>pcb[j].arrive_time) { temp=pcb[j]; pcb[j]=pcb[i]; pcb[i]=temp; }}voidmain(){ inti; printf("進程初始狀態(tài)\n"); output(); printf("進程按到達時間排序后的狀態(tài)\n"); sortPCB(); output(); for(i=0;i<N;i++) { //下面計算本進程的完成時間 if(i==0) pcb[i].finish_time=pcb[i].run_time+pcb[i].arrive_time; else if(pcb[i].arrive_time<pcb[i-1].finish_time) pcb[i].finish_time=pcb[i-1].finish_time+pcb[i].run_time; else pcb[i].finish_time=pcb[i].arrive_time+pcb[i].run_time; //下面計算本進程的周轉時間 pcb[i].zhouzhuan_time=pcb[i].finish_time-pcb[i].arrive_time; //下面計算本進程的帶權周轉時間pcb[i].daiquan_time=(float)pcb[i].zhouzhuan_time/pcb[i].run_time; } inttotal_zhouzhuan_time=0; floattotal_daiquan_time=0; for(i=0;i<N;i++) { total_zhouzhuan_time+=pcb[i].zhouzhuan_time; total_daiquan_time+=pcb[i].daiquan_time; } pinjun_zhouzhuan_time=(float)total_zhouzhuan_time/N; pinjun_daiquan_time=total_daiquan_time/N; printf("計算后的結果輸出\n");