《动态优先权进程调度算法模拟》由会员分享，可在线阅读，更多相关《动态优先权进程调度算法模拟（14页珍藏版）》请在金锄头文库上搜索。
1、使用动态优先权的进程调度算法模拟1、内容（1）用 C 语言来实现对 N 个进程采用动态优先权优先算法的进程调度。（2）每个用来标识进程的进程控制块 PCB 用结构来描述，包括以下字段：进程标识数 ID。进程优先数 PRIORITY，并规定优先数越大的进程，其优先权越高。进程已占用的 CPU 时间 CPUTIME。进程还需占用的 CPU 时间 ALLTIME。当进程运行完毕时，ALLTIME 变为 0。进程的阻塞时间 STARTBLOCK，表示当进程再运行 STARTBLOCK 个时间片后，将进入阻塞状态。进程被阻塞的时间 BLOCKTIME，表示已足赛的进程再等待 BLOCKTIME个时间片后
2、，将转换成就绪状态。进程状态 START。队列指针 NEXT，用来将 PCB 排成队列。（3）优先数改变的原则：进程在就绪队列中呆一个时间片，优先数加 1。进程每运行一个时间片，优先数减 3。（4）假设在调度前，系统中有 5 个进程，它们的初始状态如下：ID 0 1 2 3 4PRIORITY 9 38 30 29 0CPUTIME 0 0 0 0 0ALLTIME 3 3 6 3 4STARTBLOCK 2 -1 -1 -1 -1BLOCKTIME 3 0 0 0 0STATE READY READY READY READY READY（3） 为了清楚的观察各进程的调度过程，程序应将每个时间
3、片内的情况显示出来，参照的具体格式如下：RUNNING PROG：iREADY-QUEUE：-id1-id2BLOCK-QUEUE：-id3-id4= = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = =ID 0 1 2 3 4PRIORITY P0 P1 P2 P3 P4CUPTIME C0 C1 C2 C3 C4ALLTIME A0 A1 A2 A3 A4STARTBLOCK T0 T1 T2 T3 T4BLOCKTIME B0 B1 B2 B3 B4STATE S0 S1 S2 S3 S42、程
4、序示例：/使用动态优先权的进程调度算法的模拟 #include #define N 5void init();void print();int getRunning();void sort();int run(int time);enum STATEReady,Run,Block,RunOut;struct PROCESSint ID;int Priority;int Cputime;int Alltime;int Startblock;int Blocktime;enum STATE State;ProcessN;int READYN;int BLOCKN;int RUNOUTN2;int
5、main()int Time=0;init();printf(Time:%dn,Time);sort();print();while(1)Time+;getchar();printf(Time:%dn,Time);if(run(Time)break;/ sort();/print(Time);return 0;void init()int i;/printf(Input properties of %d process(PRIORITY,ALLTIME,STARTBLOCK,BLOCKTIME):n,/ N);for(i=0;i=0)printf(tRUNNING PROG: %dn,getR
6、unning();printf(tREADY_QUEUE:);for(i=0;i=0)printf(-%d,ProcessREADYi.ID);elsebreak; printf(ntBLOCK_QUEUE:);for(i=0;i=0)printf(-%d,ProcessBLOCKi.ID);elsebreak;printf(n=n);printf(IDt);for(i=0;i=0)printf(-%d(%d),ProcessRUNOUTi0.ID,RUNOUTi1);elseprintf(n);break; printf(n);int getRunning()int i;for(i=0;ij
7、;-k)READYk=READYk-1;READYj=i;break;else if(Processi.State=Block)for(j=0;j=ProcessBLOCKj.Blocktime) continue; elsefor(k=N-1;kj;-k)BLOCKk=BLOCKk-1;BLOCKj=i;break;int run(int time)int i,runNum;runNum=READY0;if(runNum=0)ProcessrunNum.Priority-=3;ProcessrunNum.Alltime-=1;ProcessrunNum.Cputime+=1;Processr
8、unNum.State=Run;for(i=0;i=0)ProcessrunNum.Startblock-=1;if(ProcessrunNum.Startblock=0)ProcessrunNum.State=Block;/ProcessrunNum.Startblock-=1;else if(BLOCK0=0)for(i=0;i1-2-3-0-4BLOCK_QUEUE:=ID 0 1 2 3 4PRIORITY 9 38 30 29 0CPUTIME 0 0 0 0 0ALLTIME 3 3 6 3 4STARTBLOCK 2 -1 -1 -1 -1BLOCKTIME 3 0 0 0 0S
9、TATE Ready Ready Ready Ready ReadyRUNOUT LIST:0Time:1RUNNING PROG: 1READY_QUEUE:-1-2-3-0-4BLOCK_QUEUE:=ID 0 1 2 3 4PRIORITY 10 35 31 30 1CPUTIME 0 1 0 0 0ALLTIME 3 2 6 3 4STARTBLOCK 2 -1 -1 -1 -1BLOCKTIME 3 0 0 0 0STATE Ready Run Ready Ready ReadyRUNOUT LIST:Time:2RUNNING PROG: 1READY_QUEUE:-1-2-3-0
10、-4BLOCK_QUEUE:=ID 0 1 2 3 4PRIORITY 11 32 32 31 2CPUTIME 0 2 0 0 0ALLTIME 3 1 6 3 4STARTBLOCK 2 -1 -1 -1 -1BLOCKTIME 3 0 0 0 0STATE Ready Run Ready Ready ReadyRUNOUT LIST:Time:3 RUNNING PROG: 1READY_QUEUE:-2-3-0-4BLOCK_QUEUE:=ID 0 1 2 3 4PRIORITY 12 29 33 32 3CPUTIME 0 3 0 0 0ALLTIME 3 0 6 3 4STARTB
11、LOCK 2 -1 -1 -1 -1BLOCKTIME 3 0 0 0 0STATE Ready Run Ready Ready ReadyRUNOUT LIST:-1(3)Time:4RUNNING PROG: 2READY_QUEUE:-3-2-0-4BLOCK_QUEUE:=ID 0 1 2 3 4PRIORITY 13 29 30 33 4CPUTIME 0 3 1 0 0ALLTIME 3 0 5 3 4STARTBLOCK 2 -1 -1 -1 -1BLOCKTIME 3 0 0 0 0STATE Ready RunOut Run Ready ReadyRUNOUT LIST:-1(3)Time:5RUNNING PROG: 3READY_QUEUE:-2-3-0-4BLOCK_QUEUE:=ID 0 1
