任務(wù)調(diào)度實驗

-.z.大作業(yè)三任務(wù)調(diào)度：**：班級：日期:2015年7月1需求說明本次實驗的目標(biāo)是在Linu*環(huán)境下實現(xiàn)任務(wù)調(diào)度仿真，利用多線程實現(xiàn)任務(wù)池中的多個任務(wù)，支持先來先效勞、輪轉(zhuǎn)和反應(yīng)三種調(diào)度策略，提高對Linu*環(huán)境下多進程、多線程和單處理器調(diào)度等知識的理解。2設(shè)計說明設(shè)有任務(wù)A、B、C、D、E，分別具有不同的優(yōu)先級和處理時間，通過一個調(diào)度線程對這5個任務(wù)進展調(diào)度。2.1構(gòu)造設(shè)計將先來先效勞與優(yōu)先級隊列用構(gòu)造體數(shù)組進展設(shè)計，對到達時間、運行時間完畢時間進展相關(guān)的調(diào)度與修改將時間片輪轉(zhuǎn)用循環(huán)隊列來表示，使五種不同任務(wù)不斷的論尋，直至運行完畢。2.2功能設(shè)計正確輸出三種調(diào)度算法下，任務(wù)的執(zhí)行順序、每個任務(wù)占用CPU的時間以及優(yōu)先級隊列〔反應(yīng)調(diào)度〕通過一個調(diào)度進程實現(xiàn)任務(wù)調(diào)度有輸出界面，在每個時間點輸出任務(wù)狀態(tài)、每個任務(wù)已經(jīng)占用CPU時間和還需CPU時間，已經(jīng)執(zhí)行的任務(wù)順序和時間。3測試和使用說明3.1使用說明 無3.2測試說明4程序清單[cpp]viewplaincopyOBJS=main.ofcfs_sjf.ocl.oa.out:$(OBJS)mon.hgcc$(OBJS)-oa.outmain.o:main.cmon.hgcc-cmain.cfcfs_sjf.o:fcfs_sjf.cmon.hgcc-cfcfs_sjf.ccl.o:cl.cmon.hgcc-ccl.cmon.h#include<stdio.h>#include"stdio.h"#include"string.h"#defineNULL0/*定義構(gòu)造*/typedefstructquen{charpname[8];inttime1;inttime2;charstate;structquen*ne*t;}QUEN;floatt,d;struct{intid;floatArriveTime;floatRequestTime;floatStartTime;floatEndTime;floatRunTime;floatDQRunTime;intstatus;}arrayTask[4];voidGetTask();ntfcfs();intsjf();voidnew_n(ints);voidPrintresult(intj);voidcl();fcfs_sjf.cvoidGetTask(){inti;floata;for(i=0;i<=4;i++){arrayTask[i].id=i+1;printf("inputthenumber");printf("inputtheArriveTimeofarrayTask[%d]:",i);scanf("%f",&a);arrayTask[i].ArriveTime=a;printf("inputtheRequestTimeofarrayTask[%d]:",i);scanf("%f",&a);arrayTask[i].RequestTime=a;arrayTask[i].StartTime=0;arrayTask[i].EndTime=0;arrayTask[i].RunTime=0;arrayTask[i].status=0;}}/*定義FCFS中尋找未執(zhí)行的進程的最先到達時間*/intfcfs(){inti,j,w;for(i=0;i<=4;i++){if(arrayTask[i].status==0){t=arrayTask[i].ArriveTime;w=1;}if(w==1){break;}}for(i=0;i<=4;i++)/*查找數(shù)組中到達時間最小未執(zhí)行的進程*/{if(arrayTask[i].ArriveTime<t&&arrayTask[i].status==0){t=arrayTask[i].ArriveTime;}}for(i=0;i<=4;i++)/*返回最小到達時間的數(shù)組的下標(biāo)*/{if(arrayTask[i].ArriveTime==t){returni;}}}//最短作業(yè)優(yōu)先算法SJFintsjf()/*定義FCFS中尋找未執(zhí)行的進程的最先到達時間*/{inti,*=0,a=0,b=0;/*判斷是不是第一個執(zhí)行的進程*/floatg;for(i=0;i<=4;i++){if(arrayTask[i].status==1){g=arrayTask[i].EndTime;*=1;}}if(*==0){t=arrayTask[0].ArriveTime;for(i=0;i<=4;i++){if(arrayTask[i].ArriveTime<t){t=arrayTask[i].ArriveTime;a=i;}}returna;}else{for(i=0;i<=4;i++){if(arrayTask[i].EndTime>g){g=arrayTask[i].EndTime;}}for(i=0;i<=4;i++){if(arrayTask[i].status==0&&arrayTask[i].ArriveTime<=g){t=arrayTask[i].RequestTime;a=i;b=1;}/*判斷有沒有進程在前個進程完成前到達*/}if(b!=0)/*有進程到達則按SJF*/{for(i=0;i<=4;i++){if(arrayTask[i].status==0&&arrayTask[i].ArriveTime<=g&&arrayTask[i].RequestTime<t){t=arrayTask[i].RequestTime;a=i;}}returna;}else{/*否則按FCFS*/for(i=0;i<=4;i++){if(arrayTask[i].status==0){t=arrayTask[i].ArriveTime;}}for(i=0;i<=4;i++){if(arrayTask[i].status==0&&arrayTask[i].ArriveTime<t){t=arrayTask[i].ArriveTime;a=i;}}returna;}}}voidnew_n(ints)/*定義執(zhí)行進程后相關(guān)數(shù)據(jù)的修改*/{inti,g=0;for(i=0;i<=4;i++){if(arrayTask[i].status==0)continue;else{g=1;break;}}if(g==0)/*當(dāng)處理的是第一個未執(zhí)行的進程時執(zhí)行*/{arrayTask[s].StartTime=arrayTask[s].ArriveTime;arrayTask[s].EndTime=arrayTask[s].RequestTime+arrayTask[s].ArriveTime;arrayTask[s].RunTime=arrayTask[s].RequestTime;arrayTask[s].status=1;g=2;}if(g==1)/*當(dāng)處理的不是第一個未執(zhí)行的進程時執(zhí)行*/{arrayTask[s].status=1;for(i=0;i<=4;i++){if(arrayTask[i].status==1)d=arrayTask[i].EndTime;}for(i=0;i<=4;i++)/*查找最后執(zhí)行的進程的完成時間*/{if(arrayTask[i].EndTime>d&&arrayTask[i].status==1)d=arrayTask[i].EndTime;}if(arrayTask[s].ArriveTime<d)/*判斷修改的進程的到達時間是否在前一個執(zhí)行的進程的完成時間前面*/{arrayTask[s].StartTime=d;}else{arrayTask[s].StartTime=arrayTask[s].ArriveTime;arrayTask[s].EndTime=arrayTask[s].StartTime+arrayTask[s].RequestTime;arrayTask[s].RunTime=arrayTask[s].EndTime-arrayTask[s].ArriveTime;}arrayTask[s].DQRunTime=arrayTask[s].RunTime/arrayTask[s].RequestTime;}}voidPrintresult(intj)/*定義打印函數(shù)*/{printf("%d\t",arrayTask[j].id);printf("%5.2f\t",arrayTask[j].ArriveTime);printf("%5.2f\t",arrayTask[j].RequestTime);printf("%5.2f\t",arrayTask[j].StartTime);printf("%5.2f\t",arrayTask[j].EndTime);printf("%5.2f\t",arrayTask[j].RunTime);printf("%5.2f\n",arrayTask[j].DQRunTime);}cl.cvoidcl(){QUEN*q,*p,*head,*m;charstr[8],f;intt,d,n;printf("Enterthema*numberofnodes(n):\n");/*輸入進程數(shù)*/scanf("%d",&n);d=n;if(d>0){printf("enterthepname:");scanf("%s",str);printf("entertheneedtime:");scanf("%d",&t);head=p=(QUEN*)malloc(sizeof(QUEN));strcpy(p->pname,str);p->time1=t;p->time2=0;p->state='R';p->ne*t=NULL;head=p;getchar();--d;}while(d>0){/*構(gòu)建隊列表*/printf("enterthepname:");scanf("%s",str);printf("enterneedtime:");scanf("%d",&t);q=(QUEN*)malloc(sizeof(QUEN));strcpy(q->pname,str);q->time1=t;q->time2=0;q->state='R';q->ne*t=NULL;p->ne*t=q;p=q;--d;p->ne*t=head;q=head;}printf("processnameneedtimerunnedstatic\n");do{printf("%s%d%d%c\n",q->pname,q->time1,q->time2,q->state);q=q->ne*t;}while(q!=head);printf("\n");do{if(head->time2<head->time1){head->time2++;if(head->time2==head->time1){head->state='E';q=head;printf("Therunningprocessis%s\n",q->pname);printf("processnamelefttimerunnedstatic\n");do{/*輸入隊列表*/printf("%s%d%d%c\n",q->pname,q->time1,q->time2,q->state);q=q->ne*t;}while(q!=head);printf("\n");head=head->ne*t;q=head;p->ne*t=head;}else{printf("Therunningprocessis%s\n",q->pname);printf("processnamelefttimerunnedstatic\n");do{printf("%s%d%d%c\n",q->pname,q->time1,q->time2,q->state);q=q->ne*t;}while(q!=head);printf("\n");head=head->ne*t;q=head;p=p->ne*t;}printf("Isitneedingnewprocess"(yorn)\n");/*是否參加新的進程*/getchar();scanf("%c",&f);if(f=='Y'||f=='y'){getchar();printf("Enterthenewpname:");scanf("%s",str);printf("Enterthenewneededtime:");scanf("%d",&t);m=(QUEN*)malloc(sizeof(QUEN));strcpy(m->pname,str);m->time1=t;m->time2=0;m->state='R';m->ne*t=NULL;if(q->ne*t->state=='E'){p=m;head=m;p->ne*t=head;q=head;}else{p->ne*t=m;m->ne*t=head;p=m;}}}}while(q->ne*t->state!='E');printf("Theprocessesarefinished\n");}main.cintmain(void){inti,b,k,c=0;chara;intd[4];//clrscr();//cls();printf("\t1.FCFS\n");printf("\t2.SFJ\n");printf("\t3.E*IT\n");printf("\t4.cl\n");for(i=0;;i++){if(c){break;}printf("pleaseinputthenumbera:\n");scanf("%d",&a);switch(a){case3:c=1;break;case1:printf("pleaseinputthedifferent-ArriveTimeofa