c++实现进程调度.docVIP

#include iostream #include string #include conio.h #include windows.h #includeiomanip #include stdlib.h using namespace std; class PCB_Control;//进程控制类 class PCB//进程控制块结点 { public: friend class PCB_Control; PCB *Next; int No; int Priority; int Need_Time; int Used_Time; char Station; int Time_Priority; PCB(PCB *ptrnext=NULL)//构造头结点 {Next=ptrnext;} PCB( int no1,int pri1,int need_time1,int used_time1,char station1,int timepriority,PCB *ptrnext=NULL)//构造普通结点 { No=no1; Priority=pri1; Need_Time=need_time1; Used_Time=used_time1; Station=station1; Time_Priority=timepriority; Next=ptrnext; } ~PCB(void){} }; class PCB_Control { private: PCB *head; int size; int time_priority;//时间优先级 char ini_station;//初始状态 int used_time; public: PCB_Control(void)//构造函数 { head=new PCB; size=0; time_priority=1000; } void Ini_Insert(int no,int priority,int need_time)//对输入的进程进行初始化 { used_time=0; ini_station=W; PCB *newnode=new PCB(no,priority,need_time,used_time,ini_station,time_priority,NULL); Insert_And_Sort(newnode); time_priority--; } void Insert_And_Sort(PCB *ins)//插入函数，插入时并按照优先级和时间进行排序 { if(size==0) { ins-Next=NULL; head-Next=ins; size++; } else { PCB *front=head; for(int m=0;msize;m++)//按最高优先级调度算法插入，同等优先级下按先来先服务算法插入 { if(ins-Priority!=Index(m)-Priority)//最高优先级调度 { if(ins-PriorityIndex(m)-Priority) { ins-Next=Index(m); front-Next=ins; break; } if(ins-PriorityIndex(m)-Priority) { if(Index(m)-Next==NULL) { Index(m)-Next=ins; ins-Next=NULL; break; } else { front=front-Next; continue; } } } else //同优先级下按先来先服务算法 { if(ins-Time_PriorityIndex(m)-Time_Priority) { if(Index(m)-Next==NULL) { ins-Next=NULL; Index(m)-Next=ins; break; } else { front=front-Next; continue; }