操作系統(tǒng)實(shí)驗(yàn)-先來(lái)先服務(wù)、短作業(yè)優(yōu)先算法

1、精選優(yōu)質(zhì)文檔-傾情為你奉上實(shí)驗(yàn)報(bào)告【實(shí)驗(yàn)名稱(chēng)】 實(shí)驗(yàn)一 進(jìn)程調(diào)度 【實(shí)驗(yàn)?zāi)康摹快柟毯图由钐幚頇C(jī)調(diào)度的概念?！緦?shí)驗(yàn)內(nèi)容】設(shè)計(jì)調(diào)度算法，模擬實(shí)現(xiàn)處理機(jī)的調(diào)度。1. 設(shè)計(jì)先來(lái)先服務(wù)調(diào)度算法數(shù)據(jù)結(jié)構(gòu)和符號(hào)說(shuō)明：typedef struct PCB char name10; /進(jìn)程名 char state;/進(jìn)程狀態(tài) int arrivetime; /到達(dá)時(shí)間 int starttime;/開(kāi)始時(shí)間 int finishtime; /完成時(shí)間 int servicetime;/服務(wù)時(shí)間 float turnaroundtime;/周轉(zhuǎn)時(shí)間 float weightedturnaroundtime;/帶權(quán)

2、周轉(zhuǎn)時(shí)間 struct PCB *next;/指向下個(gè)進(jìn)程的指針pcb;int time;/全局變量，計(jì)時(shí)器int n;/全局變量，進(jìn)程個(gè)數(shù)pcb *head = NULL,*p,*q;/進(jìn)程鏈表指針流程圖：程序源代碼/*操作系統(tǒng)實(shí)驗(yàn)一先來(lái)先服務(wù)調(diào)度算法*/#include<stdio.h>#include<stdlib.h>typedef struct PCB/進(jìn)程控制 char name10;/進(jìn)程名 char state;/進(jìn)程狀態(tài) int arrivetime;/到達(dá)時(shí)間 int starttime;/開(kāi)始時(shí)間 int finishtime;/結(jié)束時(shí)間 int

3、servicetime;/服務(wù)時(shí)間 float turnaroundtime;/周轉(zhuǎn)時(shí)間 float weightedturnaroundtime;/帶權(quán)周轉(zhuǎn)時(shí)間 struct PCB *next;/指向下個(gè)進(jìn)程pcb;int time;/當(dāng)前時(shí)間int n;/進(jìn)程個(gè)數(shù)pcb *head = NULL,*p,*q;/處理未完成的進(jìn)程void run_fcfs(pcb *p1) time = p1->arrivetime > time ? p1->arrivetime : time; /如果進(jìn)程到達(dá)時(shí)間大于當(dāng)前時(shí)間，則當(dāng)前時(shí)間=到達(dá)時(shí)間 p1->starttime = t

4、ime;/當(dāng)前時(shí)間即為進(jìn)程開(kāi)始時(shí)間 printf("n現(xiàn)在時(shí)間是%d，開(kāi)始運(yùn)行作業(yè)%sn",time,p1->name); time += p1->servicetime;/進(jìn)程開(kāi)始處理，處理的時(shí)間為進(jìn)程的服務(wù)時(shí)間 p1->state = 'T'/更改狀態(tài)，表示該進(jìn)程已被處理過(guò) p1->finishtime = time;/存入完成時(shí)間 p1->turnaroundtime = p1->finishtime - p1->arrivetime;/周轉(zhuǎn)時(shí)間=完成時(shí)間-到達(dá)時(shí)間 p1->weightedturnaro

5、undtime = p1->turnaroundtime/p1->servicetime;/帶權(quán)周轉(zhuǎn)時(shí)間=周轉(zhuǎn)時(shí)間/服務(wù)時(shí)間 printf(" 到達(dá)時(shí)間 服務(wù)時(shí)間 開(kāi)始時(shí)間 完成時(shí)間 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間n");printf("%8d%10d%10d%10d%10.1f%14.2fn",p1->arrivetime,p1->servicetime,p1->starttime,p1->finishtime,p1->turnaroundtime,p1->weightedturnaroundtime);/打印輸

6、出/找到當(dāng)前未完成的進(jìn)程void fcfs() int i,j; p = head; for(i=0; i<n; i+) if(p->state = 'F') q = p;/如果當(dāng)前進(jìn)程未執(zhí)行，則開(kāi)始執(zhí)行 run_fcfs(q); p = p->next;指向下一個(gè)進(jìn)程 /輸入進(jìn)程個(gè)數(shù)與進(jìn)程信息void getInfo() int num; printf("n作業(yè)個(gè)數(shù)："); scanf("%d",&n); for(num = 0; num < n; num+) p = (pcb*)malloc(sizeo

7、f(pcb); printf("依次輸入:n"); printf("進(jìn)程名 到達(dá)時(shí)間 服務(wù)時(shí)間n"); scanf("%st%dt%d",&p->name,&p->arrivetime,&p->servicetime); if(head = NULL) head = p; q = p; time = p->arrivetime; if(p->arrivetime < time) time =p->arrivetime; q->next = p; p->sta

8、rttime = 0; p->finishtime = 0; p->turnaroundtime = 0; p->weightedturnaroundtime = 0; p->next = NULL; p->state = 'F' q = p; int main() printf("先來(lái)先服務(wù)調(diào)度算法n"); getInfo(); p = head; fcfs(); return 0;運(yùn)行結(jié)果圖1運(yùn)行結(jié)果2.設(shè)計(jì)按短進(jìn)程優(yōu)先調(diào)度算法數(shù)據(jù)結(jié)構(gòu)與符號(hào)說(shuō)明：struct sjf char name10; /進(jìn)程名 float arri

9、vetime; /到達(dá)時(shí)間 float servicetime;/服務(wù)時(shí)間 float starttime; /開(kāi)始時(shí)間 float finishtime;/完成時(shí)間 float turnaroundtime;/周轉(zhuǎn)時(shí)間 float dqturnaroundtime;/帶權(quán)周轉(zhuǎn);/結(jié)構(gòu)體數(shù)組sjf a100;流程圖：程序源代碼/*操作系統(tǒng)實(shí)驗(yàn)一按短進(jìn)程優(yōu)先調(diào)度算法*/#include <stdio.h>struct sjf char name10; /進(jìn)程名 float arrivetime; /到達(dá)時(shí)間 float servicetime;/服務(wù)時(shí)間 float starttim

10、e; /開(kāi)始時(shí)間 float finishtime;/完成時(shí)間 float turnaroundtime;/周轉(zhuǎn)時(shí)間 float dqturnaroundtime;/帶權(quán)周轉(zhuǎn);/結(jié)構(gòu)體數(shù)組sjf a100;/輸入函數(shù)void input(sjf *p,int N) int i; printf("依次輸入:n"); for(i=0;i<=N-1;i+) printf("進(jìn)程名 到達(dá)時(shí)間 服務(wù)時(shí)間n"); scanf("%s%f%f",&,&pi.arrivetime,&pi.serviceti

11、me);/輸出函數(shù)void Print(sjf *p,float arrivetime,float servicetime,float starttime,float finishtime,float turnaroundtime,float dqturnaroundtime,int N)int k; printf("n進(jìn)程名 到達(dá)時(shí)間 服務(wù)時(shí)間 開(kāi)始時(shí)間 完成時(shí)間 周轉(zhuǎn)時(shí)間 帶權(quán)周轉(zhuǎn)時(shí)間n"); for(k=0;k<=N-1;k+)printf("%4s%10.2f%10.2f%10.2f%10.2f%10.2f%10.2fn",,

12、pk.arrivetime,pk.servicetime,pk.starttime,pk.finishtime,pk.turnaroundtime,pk.dqturnaroundtime);/按到達(dá)時(shí)間排序void sort(sjf *p,int N)for(int i=0;i<=N-1;i+) for(int j=0;j<=i;j+) if(pi.arrivetime<pj.arrivetime)sjf temp; temp=pi; pi=pj; pj=temp; /處理作業(yè)void deal(sjf *p, float arrivetime,float serviceti

13、me,float starttime,float finishtime,float &turnaroundtime,float &dqturnaroundtime,int N)int k; for(k=0;k<=N-1;k+) if(k = 0) pk.starttime = pk.arrivetime;/第一個(gè)進(jìn)程的開(kāi)始時(shí)間=到達(dá)時(shí)間 pk.finishtime = pk.arrivetime + pk.servicetime;/完成時(shí)間=到達(dá)時(shí)間+服務(wù)時(shí)間 else if(pk-1.finishtime >= pk.arrivetime) pk.starttim

14、e = pk-1.finishtime;/前一項(xiàng)作業(yè)的完成時(shí)間大于當(dāng)前項(xiàng)的到達(dá)時(shí)間則當(dāng)前項(xiàng)的開(kāi)始時(shí)間為前一項(xiàng)的結(jié)束時(shí)間 else pk.starttime = pk.arrivetime;/否則當(dāng)前項(xiàng)的開(kāi)始時(shí)間為當(dāng)前項(xiàng)的到達(dá)時(shí)間 pk.finishtime = pk.starttime + pk.servicetime;/完成時(shí)間=作業(yè)開(kāi)始時(shí)間+作業(yè)服務(wù)時(shí)間 for(k=0;k<=N-1;k+) pk.turnaroundtime = pk.finishtime - pk.arrivetime;/周轉(zhuǎn)時(shí)間=完成時(shí)間-到達(dá)時(shí)間 pk.dqturnaroundtime = pk.turnar

15、oundtime / pk.servicetime;/帶權(quán)周轉(zhuǎn)時(shí)間=周轉(zhuǎn)時(shí)間/服務(wù)時(shí)間 /短作業(yè)優(yōu)先調(diào)度算法void sjff(sjf *p,int N)float arrivetime = 0;float servicetime = 0;float starttime = 0;float finishtime = 0;float turnaroundtime = 0;float dqturnaroundtime = 0;sort(p,N);/調(diào)用sort函數(shù)進(jìn)行排序 for(int m=0;m<N-1;m+)if(m = 0)/第一項(xiàng)作業(yè) pm.finishtime = pm.arri

16、vetime + pm.servicetime;/完成時(shí)間=到達(dá)時(shí)間+服務(wù)時(shí)間 elseif(pm-1.finishtime >= pm.arrivetime )pm.starttime = pm-1.finishtime;/上一項(xiàng)進(jìn)程結(jié)束后本進(jìn)程才開(kāi)始elsepm.starttime = pm.arrivetime;pm.finishtime = pm.starttime + pm.servicetime;/完成時(shí)間=開(kāi)始時(shí)間+服務(wù)時(shí)間int i = 0; for(int n=m+1;n<=N-1;n+)if(pn.arrivetime <= pm.finishtime) i+; /按服務(wù)時(shí)間排序 float min=pm+1.servicetime; int next=m+1;/m+1=n for(int k=m+1;k<m+i;k+) if(pk+1.servicetime<min)/k+1項(xiàng)的服務(wù)時(shí)間小于最小項(xiàng)則k+1項(xiàng)為最小項(xiàng) min=pk+1.servicetime; next=k+1; sjf temp; temp=pm+1; pm+1=pnext; pnext=temp; deal(p,arrivetime,servicetime,starttime,finishtime,turnaroundtime,dqturnaro