进程调度算法简介
进程调度算法的重点是掌握优先级算法和轮转算法。优先级是算法又分为静态优先级算法和动态优先级算法。动态优先级算法是指在进程创建时先确定一个初始优先级,以后在进程运行中随着进程特性的改变而不断修改它的优先级,这样,就使得开始优先级很低而得不到CPU的进程,就能因为等待时间的增加,它的优先级变为最高而得到运行。
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#define getpch(type)(type*)malloc(sizeof(type))
struct pcb{
char name[10];
char state;
int super;
int ntime;
int rtime;
struct pcb *link;
}*ready=NULL,*p;
typedef struct pcb PCB;
//--------------------------------------------------------------------------------------------------------------
void inuniazation()
{
printf("\n\n\t\t********************************************************\n\n\t\t");
printf("\t\t\t\t实验一 进程调度\n");
printf("\t\t************************************************************\t\t\n");
printf("\n\n\n\t\t\t计算机系1班\n");
printf("\t\t\t姓名:xxx\n");
printf("\t\t\t姓名:xxx\n");
printf("\t\t\t学号:xxxxxxxxxxx\n");
printf("\t\t\t完成时间:2023年4月10日\n\n\n");
printf("\t\t\t\t请按任意键进入演示过程\n");
getch();
}
//--------------------------------------------------------------------------------------------------------------
void sort()
{
PCB * first,*second;
int insert=0;
if((ready==NULL) || ((p->super)>(ready->super)))
{
p->link=ready;
ready=p;
}
else{
first=ready;
second=first->link;
while(second!=NULL)
{
if((p->super)>(second->super)){
p->link=second;
first->link=p;
second=NULL;
insert=1;
}
else{
first=first->link;
second=second->link;
}
}
if(insert==0) first->link=p;
}
}
//---------------------------------------------------------------------------------------------------------------
void input()
{
int i;
system("cls");
printf("\n请输入六个进程信息:\n");
for(i=0;i<6;i++)
{
printf("\n进程号No.%d:\n",i+1);
p= getpch(PCB);
printf("%s",p->name);
printf("\n输入进程优先数:");
scanf("%d",&p->super);
printf("\n输入进程运行时间:");
scanf("\n");
p->rtime=0;
p->state='w';
p->link=NULL;
sort();
}
}
//---------------------------------------------------------------------------------------------------------------
int space()
{
int l=0;PCB* pr=ready;
while(pr!=NULL)
{
l++;
pr=pr->link;
}
return(l);
}
//----------------------------------------------------------------------------------------------------------------
void disp(PCB* pr)
{
printf("\n qname \tstate \tsuper \tndtime runtime \n" );
printf("|%s\t",pr->name);
printf("|%c\t",pr->state);
printf("|%d\t",pr->super);
printf("|%d\t",pr->ntime);
printf("|%d\t",pr->rtime);
printf("\n");
}
void check()
{
PCB * pr;
printf("\n **** 当前正在运行的进城是:%s",p->name);
disp(p);
pr=ready;
printf("\n **** 当前就绪对列状态为:\n");
while(pr!=NULL)
{
disp(pr);
pr=pr->link;
}
}
void destroy()
{
printf("\n 进程[%s]已完成.\n",p->name);
free(p);
}
void running()
{
(p->rtime)++;
if(p->rtime==p->ntime)
destroy();
else
{
(p->super)--;
p->state='w';
sort();
}
}
void youxian()
{
int len,h=0;
char ch;
system("cls");
input();
len=space();
while((len!=0)&&(ready!=NULL));
{
ch=getchar();
h++;
printf("\n The execute number:%d \n",h);
p=ready;
ready=p->link;
p->link=NULL;
p->state='R';
check();
running();
printf("\n 按任意键继续......");
}
printf("\n\n进程已经完成.\n");
ch=getchar();
}
void RoundRobin()
{
//等待编程
}
void menu() {
int m;
system("cls");
printf("\n\n\t\t********************************************************\n\n\t\t");
printf("\t\t\t\t进程调度演示\n");
printf("\t\t************************************************************\t\t\n");
printf("\n\n\n\t\t\t演示最高优先数优先算法\n");
printf("\n\t\t\t2.演示轮转法算法.");
printf("\n\t\t0.退出程序.");
printf("\n\n\t\t\t\t选择进程调度方法:");
scanf("%d",&m);
switch(m)
{
case 1:
youxian();
system("cls");
menu();
break;
case 2:
RoundRobin();
system("cls");
menu();
break;
case 0:
system("sle");
break;
default:
system("cls");
menu();
}
}
int main()
{
inuniazation();
menu();
}