進程調(diào)度(C語言實現(xiàn))

1、#include#include#includetypedef struct ProcessNode / 進程結(jié)點的基本結(jié)構(gòu) char name; /進程名int service_time; /服務(wù)時間int arrive_time; /到達時間int priority; /優(yōu)先級struct FCFS_time /先到先服務(wù)int finish_time; /完成時間 int turnaround_time; /周轉(zhuǎn)時間float weigtharound_time;/帶權(quán)周轉(zhuǎn)時間FCFS_time; struct SJF_time /短作業(yè)優(yōu)先int finish_time; int tu

2、rnaround_time; float weigtharound_time;int flag;SJF_time; struct RR_time /時間片輪轉(zhuǎn)的結(jié)點int finish_time; int turnaround_time; float weigtharound_time;int flag_time;/賦值為進程的服務(wù)時間，為0則進程完成RR_time; struct Pri_time /優(yōu)先權(quán)非搶占式int finish_time; int turnaround_time; float weigtharound_time;Pri_time;struct ProcessNode*

3、next;ProcessNode,*Linklist;void main() int choice; Linklist p,head; Linklist read_information();Linklist FCFS_scheduling(Linklist head); Linklist SJF_scheduling(Linklist head); Linklist RR_scheduling(Linklist head); Linklist Pri_scheduling(Linklist head); head=read_information();/讀入進程的基本信息do p=head-

4、next; printf(n);printf(*進程初始信息輸出* n); /輸出初始化后的進程基本信息printf(n);printf(進程名稱 ); printf(到達時間 ); printf(服務(wù)時間 ); printf(優(yōu)先級 ); printf(n);while(p) printf( %c ,p-name); printf( %d ,p-arrive_time); printf( %d ,p-service_time); printf( %d ,p-priority); printf(n); p=p-next;printf(n); printf(* n);/輸出進程的調(diào)用選擇項pri

5、ntf(n);printf(1、FCFS-先到先服務(wù)n);printf(2、SJF-短作業(yè)優(yōu)先n);printf(3、RR-時間片輪轉(zhuǎn)n);printf(4、Pri-優(yōu)先權(quán)調(diào)度n); printf(5、退出n);printf(n);printf(* n);printf(n);printf(請在15之間選擇: );scanf(%d,&choice);printf(n); printf(n); switch(choice) case 1: FCFS_scheduling(head); break; case 2: SJF_scheduling(head); break; case 3: RR_sc

6、heduling(head); break; case 4: Pri_scheduling(head); break; / case 5: exit(); while(choice!=5);Linklist read_information()/進程讀入函數(shù) int i; intnum; / ProcessNode ;Linklist pro;Linklist p; Linklist head; printf(n); printf(*進程調(diào)度算法* n);printf(n);printf(請輸入進程的個數(shù):); scanf(%d,&num);printf(n);printf(*初始化信息* n

7、);printf(n); head=(Linklist)malloc(sizeof(ProcessNode);/頭結(jié)點head-next=NULL;p=head; for(i=1;iname);printf( 到達時間: );scanf(%d,&pro-arrive_time);printf( 服務(wù)時間: ); scanf(%d,&pro-service_time);printf( 優(yōu)先級: );scanf(%d,&pro-priority); /pro-next=head-next; head-next=pro;/逆序建鏈 p-next=pro; p=pro;/順序建鏈/p+;pro-nex

8、t=NULL; printf(n); return head; Linklist FCFS_scheduling(Linklist head)/先到先服務(wù)算法函數(shù) Linklist p; Linklist q;/指向前一進程 p=head-next; while(p) /初始化進程的完成時間、周轉(zhuǎn)時間、帶權(quán)周轉(zhuǎn)時間，初值均賦為0 p-FCFS_time.finish_time=0; p-FCFS_time.turnaround_time=0; p-FCFS_time.weigtharound_time=0; p=p-next; p=q=head-next; p-FCFS_time.finish

9、_time=p-arrive_time;/避免第一個進程到達時間不為0 while(p) if(p-arrive_timeFCFS_time.finish_time)/下一進程已到達，在等待中 p-FCFS_time.finish_time=(p-service_time)+(q-FCFS_time.finish_time);/服務(wù)時間 p-FCFS_time.turnaround_time=(p-FCFS_time.finish_time)-(p-arrive_time);/周轉(zhuǎn)時間 p-FCFS_time.weigtharound_time=(float)(p-FCFS_time.turn

10、around_time)/(p-service_time);/帶權(quán)周轉(zhuǎn)時間 else p-FCFS_time.finish_time=p-service_time+p-arrive_time;/服務(wù)時間 p-FCFS_time.turnaround_time=(p-FCFS_time.finish_time)-(p-arrive_time);/周轉(zhuǎn)時間 p-FCFS_time.weigtharound_time=(float)(p-FCFS_time.turnaround_time)/(p-service_time);/帶權(quán)周轉(zhuǎn)時間 q=p; p=p-next; p=head-next; pr

11、intf(* FCFS * n);/輸出先到先服務(wù)調(diào)度后的進程信息printf(n);printf(進程名稱 ); printf(到達時間 ); printf(服務(wù)時間 ); printf(優(yōu)先級 );printf(完成時間 );printf(周轉(zhuǎn)時間 ); printf(帶權(quán)周轉(zhuǎn)時間 ); printf(n); while(p) printf( %c ,p-name);printf( %d ,p-arrive_time); printf( %d ,p-service_time); printf( %d ,p-priority); printf( %d,p-FCFS_time.finish_t

12、ime); printf( %d,p-FCFS_time.turnaround_time); printf( %0.2f,p-FCFS_time.weigtharound_time); printf(n);p=p-next; printf(n); printf(* n); printf(n); return head;Linklist SJF_scheduling(Linklist head)/短作業(yè)優(yōu)先算法 Linklist p,r;Linklist q;/指向前一進程結(jié)點 int num=0;/記錄進程個數(shù) int add_flag=0;/進程完成服務(wù)個數(shù)int service_time_

13、min;int arrive_time;int k;p=head-next;/首元結(jié)點 while(p) /初始化進程的完成時間、周轉(zhuǎn)時間、帶權(quán)周轉(zhuǎn)時間，初值均賦為0 p-SJF_time.finish_time=0; p-SJF_time.turnaround_time=0; p-SJF_time.weigtharound_time=0; p-SJF_time.flag=0; +num; q=p; p=p-next; q-next=head-next;/將創(chuàng)建的進程隊列變?yōu)檠h(huán)隊列 p=head-next;q=p;p-SJF_time.finish_time=p-arrive_time+p-

14、service_time; p-SJF_time.turnaround_time=(p-SJF_time.finish_time)-(p-arrive_time);/周轉(zhuǎn)時間 p-SJF_time.weigtharound_time=(float)(p-SJF_time.turnaround_time)/(p-service_time);/帶權(quán)周轉(zhuǎn)時間q-SJF_time.finish_time=p-SJF_time.finish_time; p-SJF_time.flag=1;add_flag=1;p=p-next; do if(p-SJF_time.flag=1)p=p-next; els

15、e if(p-arrive_time)(q-SJF_time.finish_time) service_time_min=p-service_time; arrive_time=p-arrive_time; while(p-arrive_time=arrive_time&p-SJF_time.flag=0)/尋找最短的作業(yè) if(p-next-service_time)service_time)service_time_min=p-next-service_time;p=p-next; else p=p-next; p=q-next; r=q; while(p-service_time!=se

16、rvice_time_min)p=p-next;/指針指向最短作業(yè) p-SJF_time.finish_time=p-arrive_time+p-service_time; p-SJF_time.flag=1;+add_flag; p-SJF_time.turnaround_time=(p-SJF_time.finish_time)-(p-arrive_time);/周轉(zhuǎn)時間 p-SJF_time.weigtharound_time=(float)(p-SJF_time.turnaround_time)/(p-service_time);/帶權(quán)周轉(zhuǎn)時間 q=p;p=r-next; else k

17、=0; service_time_min=p-service_time; while(p-arrive_time)SJF_time.finish_time)&kSJF_time.flag=1) p=p-next;+k; else if(p-SJF_time.flag!=1)&(p-service_time)service_time; p=p-next;+k; else p=p-next;+k; p=q-next; r=q; while(p-service_time!=service_time_min)p=p-next;/指針指向最短作業(yè) p-SJF_time.finish_time=q-SJF

18、_time.finish_time+p-service_time; p-SJF_time.turnaround_time=(p-SJF_time.finish_time)-(p-arrive_time);/周轉(zhuǎn)時間 p-SJF_time.weigtharound_time=(float)(p-SJF_time.turnaround_time)/(p-service_time);/帶權(quán)周轉(zhuǎn)時間 p-SJF_time.flag=1;+add_flag; /q=p;p=p-next; q=p;p=r-next; while(add_flag!=num); for(p=head-next;num0;n

19、um-)/斷開循環(huán)隊列 q=p;p=p-next;q-next=NULL; p=head-next;/指向鏈首，輸出短作業(yè)調(diào)度后的進程信息 printf(n); printf(* SJF * n);printf(n);printf(進程名稱 ); printf(到達時間 ); printf(服務(wù)時間 ); printf(優(yōu)先級 );printf(完成時間 );printf(周轉(zhuǎn)時間 ); printf(帶權(quán)周轉(zhuǎn)時間 ); printf(n); while(p) printf( %c ,p-name);printf( %d ,p-arrive_time); printf( %d ,p-servi

20、ce_time); printf( %d ,p-priority); printf( %d,p-SJF_time.finish_time); printf( %d,p-SJF_time.turnaround_time); printf( %0.2f,p-SJF_time.weigtharound_time); printf(n);p=p-next; printf(n); printf(* n); printf(n); return head;Linklist RR_scheduling(Linklist head)/時間片輪轉(zhuǎn)算法Linklist q;/指向前一進程結(jié)點 Linklist p;

21、int q_time;/時間片大小int num=0;/記錄進程個數(shù) int add_flag=0;/進程完成服務(wù)個數(shù) printf(請輸入時間片的大小: );scanf(%d,&q_time); p=head-next; while(p) /初始化進程的完成時間、周轉(zhuǎn)時間、帶權(quán)周轉(zhuǎn)時間，初值均賦為0 p-RR_time.finish_time=0; p-RR_time.turnaround_time=0; p-RR_time.weigtharound_time=0; p-RR_time.flag_time=p-service_time; q=p; +num; p=p-next; q-next

22、=head-next;/將創(chuàng)建的進程隊列變?yōu)檠h(huán)隊列 p=head-next; q-RR_time.finish_time=p-arrive_time;do /* printf(n); printf(* n); printf( %c ,p-name); printf( %d ,p-arrive_time); printf( %d ,p-service_time); printf( %d ,p-priority); printf( %d,p-RR_time.finish_time); printf(n); */ if(p-RR_time.flag_time)(q_time)/服務(wù)時間大于時間片

23、p-RR_time.finish_time=(q-RR_time.finish_time)+(q_time);/累加完成時間 p-RR_time.flag_time=(p-RR_time.flag_time)-(q_time); if(p-next-arrive_time)RR_time.finish_time)/有進程等待 q=p;p=p-next; else /當前進程未完成，無進程等待，指針不向后移 q=p; else if(p-RR_time.flag_time)=0)/進程已經(jīng)完成 p=p-next; else p-RR_time.finish_time=(q-RR_time.finish_time)+(p-RR_time.flag_time); p-RR_time.flag_time=0; +add_flag; p-RR_time.turnaround_time=(p-RR_time.finish_time)-(p-arrive_time);/周轉(zhuǎn)時間 p-RR_time.weigtharound_time=(float)(p-RR_time.turnaround_time)/(p-service_time);/帶權(quán)周轉(zhuǎn)時間 if(p-next-arrive_time)RR_time.finish_time)/有進程等待 q=p;p=p-