先来先服务和短作业优先的代码实现.doc

Pcb.h:#ifndef PCH_H#define PCB_Hstruct pcbint num;char name10;int in_time;int server_time;int finish_time;int cur_time;float power_cur_time;#endifList.h:#ifndef LIST_H_#define LIST_H_#includepcb.htypedef struct liststruct pcb _pcb;struct list *next;List,*pList;void InitList(List *pHead);void InsertHead( List *pHead,int _num,char *_name,int _in_time,int _server_time);void Delete(List *phead,List *p);void Insert(List *phead,List *p);List * FindMin(List *phead);List * FindShort(List *phead);void InsertArriver(List *phead,List *desHead,int time);static List *BuyNode();void Print(List *phead);#endifList.c:#include#include#includelist.h#include#include#includeusing namespace std;void InitList(List *pHead)*pHead=BuyNode();(*pHead)-next = NULL;void InsertHead(List *pHead,int _num,char *_name,int _in_time,int _server_time)List *p=BuyNode();assert( *pHead != NULL );assert(p!=NULL);(p-_pcb).num=_num;strcpy(p-_pcb).name,_name);(p-_pcb).in_time=_in_time;(p-_pcb).server_time=_server_time;p-next=(*pHead)-next;(*pHead)-next=p;void Delete(List *phead,List *p)List *pre=phead;while(pre-next != p)pre=pre-next ;pre-next=pre-next -next ;void Insert(List *phead,List *p)List *pre=phead;/List *pInsert=while(pre-next!= NULL&pre-next != p )pre=pre-next ;p-next =pre-next ;pre-next =p;static List *BuyNode()List *p=(List *)malloc(sizeof(List);assert(p!=NULL);return p;List * FindMin(List *phead)assert(phead != NULL & phead-next != NULL);int min_intime=phead-next -_pcb.in_time;List *p=phead-next;List *pdes=p;while(p!=NULL)if(p-_pcb.in_time _pcb.in_time;pdes=p;p=p-next ;return pdes;List * FindShort(List *phead)assert(phead != NULL & phead-next != NULL);int min_intime=phead-next -_pcb.server_time;List *p=phead-next;List *pdes=p; while(p!=NULL)if(p-_pcb.server_time _pcb.server_time;pdes=p;p=p-next ;return pdes; void InsertArriver(List *phead,List *desHead,int time)assert(phead != NULL & phead-next !=NULL);List *pcur=phead-next ;List *p=pcur;while(pcur!=NULL )if(pcur-_pcb.in_time next;Delete(phead,p);Insert(desHead,p);elsepcur=pcur-next;void Print(List *phead)if(phead!=NULL & phead-next != NULL)List *pcur=phead-next;while(pcur!=NULL)coutnum _pcb.numendl;coutname _;coutintime _pcb.in_timeendl;coutservertime _pcb.server_timeendl;coutfinish _pcb.finish_timeendl;coutcurtime _pcb.cur_timeendl;coutpower_cur_time _pcb.power_cur_timeendl;coutnext ;Spf.h:#ifndef _SPF_#define _SPF_void spf(List *phead,List *pheadAccom);#endifSpf.cpp:#includelist.h#include#includespf.hvoid spf(List *phead,List *pheadAccom)List *ArriveHead=NULL;InitList(&ArriveHead);int finish_time=0;int lastAccom_time=0;List *p=NULL;while(phead-next != NULL | ArriveHead-next !=NULL)if(phead-next != NULL) InsertArriver(phead,ArriveHead,finish_time);p=FindShort(ArriveHead);finish_time=lastAccom_time+p-_pcb .server_time ;p-_pcb .finish_time=finish_time;lastAccom_time=finish_time;p-_pcb .cur_time=p-_pcb.finish_time -p-_pcb .in_time ;p-_pcb.power_cur_time=float(p-_pcb.cur_time )/float( p-_pcb.server_time);Delete(ArriveHead,p);Insert(pheadAccom,p);Fcfs.h：#ifndef FCFS_#define FCFS_void Fcfs(List *phead,List *pheadAccom);#endifFcfs.cpp：#include#includelist.h#includeFcfs.hvoid Fcfs(List *phead,List *pheadAccom)List *p=NULL;int min_intime=0;int finish_time=0;int lastAccom_time=0;while(phead-next != NULL)p=FindMin(phead);finish_time=lastAccom_time+p-_pcb .server_time ;p-_pcb .finish_time=finish_time;lastAccom_time=finish_time;p-_pcb .cur_time=p-_pcb.finish_time -p-_pcb .in_time ;p-_pcb .power_cur_time =float(p-_pcb.cur_time )/float( p-_pcb.server_time);Insert(pheadAccom,p);Delete(phead,p);Main.cpp：#include#include#include#includelist.h#includeFcfs.h#includeSPF.Husing namespace std;int main()char name10=0;int in_time=0;int server_time=0;int i=1;char x=0;List *head=NULL;List *SPFAccom=NULL;List *FCFSAccom=NULL;InitList(&head);InitList(&SPFAccom);InitList(&FCFSAccom);printf(请输入进程的信息n);printf(进程名 到达时间 服务时间n);while(true)printf(请输入第%d个进程信息n,i);fgets(name,10,stdin);scanf(%d,&in_time);scanf(%d,&server_time);InsertHead(&head,i,name,in_time,serve