非搶占式高優(yōu)先級(jí)調(diào)度算法

1、精選優(yōu)質(zhì)文檔-傾情為你奉上/*非搶占式高優(yōu)先級(jí)調(diào)度算法（優(yōu)先數(shù)越大級(jí)別越高）算法思想：在按進(jìn)程達(dá)到時(shí)間由小到大的順序輸入進(jìn)程信息后，先對(duì)其優(yōu)先數(shù)進(jìn)行排列，將最先到達(dá)的進(jìn)程的到達(dá)時(shí)間設(shè)為開(kāi)始時(shí)間，計(jì)算結(jié)束時(shí)間， 然后對(duì)后面到達(dá)的時(shí)間與該進(jìn)程的結(jié)束時(shí)間進(jìn)行比較，如若小于該進(jìn)程的結(jié)束時(shí)間，記錄進(jìn)程的個(gè)數(shù)，再對(duì)其優(yōu)先數(shù)逐個(gè)進(jìn)行比較，將優(yōu) 先數(shù)最大的提到前面，每次進(jìn)程結(jié)束都要進(jìn)行比較，得到執(zhí)行序列，在依次輸出結(jié)果*/#include<stdio.h>#define MAX 100struct hrfschar name10;float arrvitetime;float starttime;

2、float servietime;float finishtime;int priority;/優(yōu)先數(shù)int order;/進(jìn)程執(zhí)行次序int run_flag;/標(biāo)記進(jìn)程狀態(tài);hrfs pMAX;int count;/排列到達(dá)時(shí)間/按到達(dá)時(shí)間與優(yōu)先數(shù)計(jì)算執(zhí)行序列void HRfs()float temp_time=0;int i=0,j;int k,temp_count;int max_priority;max_priority=pi.priority;j=1;while(j<count)&&(pi.arrvitetime=pj.arrvitetime) if(pj.p

3、riority>pi.priority)max_priority=pj.priority;i=j;j+;k=i;pk.starttime=pk.arrvitetime;/開(kāi)始時(shí)間=達(dá)到時(shí)間pk.finishtime=pk.starttime+pk.servietime;pk.run_flag=1;temp_time=pk.finishtime;pk.order=1;temp_count=1;while(temp_count<count)max_priority=0;for(j=0;j<count;j+)/判斷到達(dá)時(shí)間是否小于上一個(gè)進(jìn)程的結(jié)束時(shí)間并且非處在運(yùn)行狀態(tài)if(pj.a

4、rrvitetime<=temp_time)&&(!pj.run_flag)/判斷進(jìn)程優(yōu)先數(shù)是否大于最大優(yōu)先數(shù)，如果大于，就將其值賦給max_priorityif(pj.priority>max_priority)max_priority=pj.priority;k=j;pk.starttime=temp_time;pk.finishtime=pk.starttime+pk.servietime;pk.run_flag=1;temp_time=pk.finishtime;temp_count+;pk.order=temp_count;void input()int

5、i;printf("n請(qǐng)輸入進(jìn)程名 到達(dá)時(shí)間 運(yùn)行時(shí)間 優(yōu)先數(shù)，例如：a 0 100 1n");for(i=0;i<count;i+)printf("進(jìn)程%d的信息:",i+1);scanf("%s%f%f%d",,&pi.arrvitetime,&pi.servietime,&pi.priority);pi.starttime=0;pi.finishtime=0;pi.order=0;pi.run_flag=0;void print()int i;float turn_round_time

6、=0,f1,w=0;float right_turn_round_time;printf("n-進(jìn)程完成信息-n");printf("進(jìn)程名 優(yōu)先級(jí) 達(dá)到時(shí)間 運(yùn)行時(shí)間 開(kāi)始時(shí)間 結(jié)束時(shí)間 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間 運(yùn)行次序n");for(i=0;i<count;i+)f1=pi.finishtime-pi.arrvitetime;turn_round_time+=f1;right_turn_round_time=f1/pi.servietime;w+=(f1/pi.servietime);printf("%s %5d %10.2f %8.2f %8.2f %8.2f %8.2f %8.2f %8dn",,pi.priority,pi.arrvitetime,pi.servietime,pi.starttime,pi.finishtime,f1,right_turn_round_time,pi.order);printf("平均周轉(zhuǎn)時(shí)間=%5.2fn",turn_round_time/count);printf("平均帶權(quán)周轉(zhuǎn)時(shí)間=%5.2fn",w/count);void main() printf("-非搶占式