进程调度算法 操作系统.docVIP

进程调度：：优先数、时间片轮转、先来先服务 代码： #includestdio.h #includestdlib.h #includestring.h typedef struct node{ char name[10]; int prio; int round; int cputime; int needtime; int count; char state; struct node *next; }PCB; PCB *finish,*ready,*run,*r; int N; void firstin() { run = ready; run-state = R; ready = ready-next; } void prt1(char a) { if(a==P||a == p) printf(进程号 cpu时间 所需时间 优先数 状态\n); else if(a ==r||a ==R) printf(进程号 cpu时间 所需时间 记数 时间片 状态\n); else if(a==f||a==F) printf(进程号 所需时间 状态\n); } void prt2(char a ,PCB *q) { if(a==P||a == p) printf(%-10s%-10d%-10d%-10d%c\n,q-name,q-cputime,q-needtime,q-prio,q-state); else if(a == r|| a == R) printf(%-10s%-10d%-10d%-10d%-10d%c\n,q-name,q-cputime,q-needtime,q-count,q-round,q-state); else if(a==f||a==F) printf(%-10s%-10d%c\n,q-name,q-needtime,q-state); } void prt(char algo) { PCB *p; prt1(algo); if(run != NULL !(algo == r||algo ==R))//这个对RR不适应！！ prt2(algo,run); p = ready; while(p != NULL) { prt2(algo,p); p = p-next; } p = finish; while(p != NULL) { prt2(algo,p); p = p-next; } getchar(); } void insert1(PCB *q) { PCB *p1,*s,*r; int b; s = q; p1 = ready; r = p1; b = 1; while((p1 != NULL)b) { if(p1-prio = s-prio) { r = p1; p1 = p1-next; } else b = 0; } if(r != p1) { r-next = s; s-next = p1; } else { s-next = p1; ready = s; } } void creat1(char alg) { PCB *p; int i,time; char na[10]; ready = NULL; finish = NULL; run = NULL; printf(输入进程号和运行时间:\n); for(i = 1; i = N; i++) { p = (PCB *)malloc(sizeof(PCB)); scanf(%s,na); scanf(%d,time); strcpy(p-name,na); p-cputime = 0; p-needtime = time; p-state = W; p-prio = 50-time; if(ready !=