1、精選優質文檔-傾情為你奉上非搶占短作業優先算法源代碼(C語言) #include <stdio.h>#include <stdlib.h>#define MAX 5 /進程數/*短作業優先算法*/struct proint num; /進程名int arriveTime; /到達時間int burst; /運行時間;struct pro *next;/函數聲明struct pro* creatList();void insert(struct pro *head,struct pro *s); struct pro* searchByAT

2、(struct pro *head,int AT); void run(struct pro *head);void del(struct pro* p);int getCount(struct pro *head,int time);struct pro* creatList() /創建鏈表，按照進程的到達時間排列struct pro* head=(struct pro*)malloc(sizeof(struct pro);head->next=NULL;struct pro* s;int i;for(i=0;i<MAX;i+)s=(struct pro*)mal

3、loc(sizeof(struct pro);printf("請輸入進程名:n");scanf("%d",&(s->num);printf("請輸入到達時間:n");scanf("%d",&(s->arriveTime);printf("請輸入運行時間:n");scanf("%d",&(s->

4、burst);s->next=NULL;insert(head,s);return head;void insert(struct pro *head,struct pro *s) /插入節點struct pro *p=searchByAT(head,s->arriveTime);s->next=p->next;p->next=s;return;struct pro* searchByAT(struct pro *head,int AT) /查找第一個到達時間大于等于AT的節點，返回其前一個指針struct pro *p,*

5、q;p=head;q=head->next;while(q!=NULL&&q->arriveTime<=AT)p=q;q=q->next;return p;void del(struct pro* p) /刪除p的下一個節點struct pro *tmp;tmp=p->next;p->next=tmp->next;free(tmp);return;int getCount(struct pro *head,int time) /察看當前就緒隊列中的進程數int co

6、unt=0;struct pro *p,*q;p=head;q=p->next;while(q!=NULL&&q->arriveTime<=time)count+;p=q;q=q->next;return count;struct pro* SJF(struct pro *head,int count) /在頭節點后的count個節點中選擇burst最小的，返回其前一個節點的指針int min;struct pro *p,*q,*flag;p=head;q=p->next;min=q-&

7、;gt;burst;flag=p; /flag記錄返回指針while(count>0)if(q->burst<min)min=q->burst;flag=p;count-;p=q;q=q->next;return flag;void run(struct pro *head) /按短作業優先算法調度進程，并輸出其運行情況int time=0,count;struct pro *s,*t;while(head->next!=NULL)count=getCount(head,time);if(count=0) /如

8、果當前就緒隊列中沒有進程，時間自增time+;else if(count=1) /如果就緒隊列中只有1個進程，則必定是第一個節點t=head;s=t->next;printf("進程名:%dn",s->num);printf("到達時間:%dn",s->arriveTime);printf("運行開始時間:%dn",time);printf("響應時間:%dn",time-s->arriveTim

9、e);time+=s->burst;printf("運行結束時間:%dn",time);printf("周轉時間:%dn",time-s->arriveTime);printf("*n");del(t );else /如果就緒隊列中的進程數>=2，則在head后的count個節點中進行短作業優先調度t=SJF(head,count);s=t->next;printf("進程名:%dn",s->num);printf("到達時間:%dn",s->arriveTime);printf("運行開始時間:%dn",time);printf("響應時間:%dn",time-s->arriveTime);time+=s->burst;printf("運行結束時間:%dn",time);printf("周轉時間:%dn",time-s-&g