进程调度算法实现代码(操作系统)[整借鉴.pdfVIP

进程调度算法实现 // 数据：进程，队列结构 // 处理流程： //1 初始化 -- 进程队列结构（包括：就绪队列，等待队列，运行队列）等必要的数据结构 init(); //2 进入无限循环，反复调度队列 #define MAX 5 #includestdio.h #includestdlib.h int total_time=20; int time_slice=3; typedef struct process { // 进程控制块 char pname[10]; int WaitTime; int BurstTime; int priority; // 数字越小优先级越高 struct process *next; }PROCESS; //typedef struct process PROCESS; PROCESS * in_queue(PROCESS *head,PROCESS *p); // 声明 PROCESS *init() // 进程初始化 { int i=0; char a; PROCESS *head_new; // 队列的队头 head_new=(struct process*)malloc(sizeof(struct process)); if(!head_new) exit(1); head_new=NULL; do { struct process *s; printf(initialize the process:\n); s=(struct process *)malloc(sizeof(struct process)); if(!s) exit(1); printf(please input the pname:WaitTime: BurstTime: priority:\n); scanf(%c,(s-pname)); scanf(%d,(s-WaitTime)); scanf(%d,(s-BurstTime)); scanf(%d,(s-priority)); s-next=NULL; in_queue(head_new,s); i++; printf(do u want to insert process more ?? YorN\n); printf(\n); scanf(%c,a); scanf(%c,a); // if(a==Y||a==y) continue; // else if(a==N||a==n) break; }while((iMAX) (a==Y||a==y)); return head_new; } /////////////////////////////////////////////////////////// PROCESS *in_queue(PROCESS *head,PROCESS *p) // 入队函数 { if(head==NULL) { head=p; p-next=NULL; } else { p-next=head; head=p; } // printf(the process insert into the mothball queue :\n); return head; } ///////////////////////////////////////////////////////////// /* void new_queue() // 后备队列