进程调度实验

实验二进程调度算法模拟姓名：海日汗学号：20092106091概述：进程调度算法有FIFO，优先数调度算法，时间片轮转调度算法，分级调度算法。2实验目的：模拟FIFO，时间片调度算法和优先数调度算法。更深入的了解进程调度算法。3实验要求

输入：每个进程包括四个数据项：进程名进程状态(1等待2就绪3运行)所需时间优先数(0级最高)。输出:进程执行流和等待时间平均等待时间。4源代码：#include<string.h>#include<iostream>usingnamespacestd;constintblock_time=10;//定义时间片的长度为10秒constintMAXPCB=100;//定义最大进程数inta[MAXPCB];//保存各个进程几次时间偏上运行//定义进程结构体typedefstructnode{ charname[20]; //进程名字 intstate;//进程状态 intrtime;//进程运行时间 intprivilege;//进程优先级 intwait_time;//进程等待时间}pcb;pcbpcbs[MAXPCB];intquantity;//进程个数//初始化函数voidinitial(){ inti; for(i=0;i<MAXPCB;i++) { strcpy(pcbs[i].name,""); pcbs[i].state=0; pcbs[i].rtime=0; pcbs[i].privilege=0; pcbs[i].wait_time=0; } quantity=0;//进程个数}//读数据函数intreadData(){ FILE*fp; charfname[20]; inti; cout<<"请输入进程流文件名:"; cin>>fname; if((fp=fopen(fname,"r"))==NULL) { cout<<"错误,文件打不开,请检查文件名"<<endl; } else { while(!feof(fp)) { fscanf(fp,"%s%d%d%d",pcbs[quantity].name,&pcbs[quantity].state,&pcbs[quantity].rtime,&pcbs[quantity].privilege); quantity++; } //输出所读入的数据 cout<<"输出所读入的数据"<<endl; cout<<"进程名进程状态所需时间优先数"<<endl; for(i=0;i<quantity;i++) { cout<<""<<pcbs[i].name<<"\t"<<pcbs[i].state<<"\t"<<pcbs[i].rtime<<"\t"<<pcbs[i].privilege<<endl; } return(1); } return(0); }//重置数据,以供另一个算法使用voidinit(){ inti; for(i=0;i<quantity;i++) { pcbs[i].wait_time=0; }}//先进先出算法voidFIFO(){ inti,j; doubletotal; //输出FIFO算法执行流 cout<<endl<<"---------------------------------------------------------------"<<endl; cout<<"FIFO算法执行流:"<<endl; cout<<"进程名等待时间"<<endl; for(i=0;i<quantity;i++) { cout<<""<<pcbs[i].name<<""<<pcbs[i].wait_time<<endl; for(j=i+1;j<quantity;j++) { pcbs[j].wait_time+=pcbs[i].rtime; } } total=0.0; for(i=0;i<quantity;i++) { total+=pcbs[i].wait_time; } cout<<"总等待时间:"<<total<<"平均等待时间:"<<1.0*(total/quantity)<<endl; }//优先数调度算法voidprivilege(){ inti,j; doubletotal; for(i=0;i<quantity;i++) { pcbzhizhen; for(j=i+1;j<quantity;j++) { if(pcbs[i].state<pcbs[j].state) { zhizhen=pcbs[i]; pcbs[i]=pcbs[j]; pcbs[j]=zhizhen; } if(pcbs[i].state==pcbs[j].state&&pcbs[i].privilege>pcbs[j].privilege) { zhizhen=pcbs[i]; pcbs[i]=pcbs[j]; pcbs[j]=zhizhen; } if(pcbs[i].state==pcbs[j].state&&pcbs[i].privilege==pcbs[j].privilege)//状态和优先级都相等的情况，运行时间短的先运行 { if(pcbs[i].rtime>pcbs[j].rtime) { zhizhen=pcbs[i]; pcbs[i]=pcbs[j]; pcbs[j]=zhizhen; } else continue; } } } for(i=0;i<quantity;i++) { for(j=i+1;j<quantity;j++) { pcbs[j].wait_time+=pcbs[i].rtime; } } //输出优先数调度执行流 cout<<endl<<"---------------------------------------------------------------"<<endl; cout<<"优先数调度执行流:"<<endl; cout<<"进程名等待时间"<<endl; for(i=0;i<quantity;i++) { cout<<""<<pcbs[i].name<<""<<pcbs[i].wait_time<<endl; } total=0.0; for(i=0;i<quantity;i++) { total+=pcbs[i].wait_time; } cout<<"总等待时间:"<<total<<"平均等待时间:"<<1.0*(total/quantity)<<endl; }//时间片轮转调度算法intBLOCK_TIME(){ for(inti=0;i<quantity;i++) { pcbzhizhen; for(intj=i+1;j<quantity;j++) { if(pcbs[i].state<pcbs[j].state)//状态越高的先运行 { zhizhen=pcbs[i]; pcbs[i]=pcbs[j]; pcbs[j]=zhizhen; } if(pcbs[i].state==pcbs[j].state&&pcbs[i].privilege>pcbs[j].privilege)//状态相等情况要考虑优先级 { zhizhen=pcbs[i]; pcbs[i]=pcbs[j]; pcbs[j]=zhizhen; } if(pcbs[i].state==pcbs[j].state&&pcbs[i].privilege==pcbs[j].privilege)//状态和优先级都相等的情况，运行时间短的先运行 { if(pcbs[i].rtime>pcbs[j].rtime) { zhizhen=pcbs[i]; pcbs[i]=pcbs[j]; pcbs[j]=zhizhen; } else continue; } } } intflag=0;//标记运行几次时间片 intnumber=0;//时间片个数 for(i=0;i<quantity;i++) { if(pcbs[i].rtime%block_time==0) { a[i]=pcbs[i].rtime/block_time; if(a[i]>flag) flag=a[i]; } else { a[i]=pcbs[i].rtime/block_time+1; if(a[i]>flag) flag=a[i]; } } cout<<endl<<"---------------------------------------------------------------"<<endl; cout<<"时间片轮转调度执行流:"<<endl; while(flag--) { number++; for(intj=0;j<quantity;j++) { if(a[j]>=number) cout<<pcbs[j].name<<endl; } } return0;}//主函数voidmain(){ intflag; cout<<endl<<endl; cout<<"┏━━━━━━━━━━━━━━━━━━━━━━━┓"<<endl; cout<<"┃进程调度模拟系统┃"<<endl; cout<<"┠───────────────────────┨"<<endl; cout<<"┃海日汗┃"<<endl; cout<<"┃2009210609┃"<<endl; cout<<"┃412689621@┃"<<endl; cout<<"┗━━━━━━━━━━━━━━━━━━━━━━━┛"<<endl; cout<<endl<<endl; initial(); flag=readData(); if(flag==1) { FIFO(); init(); privilege(); init(); BLOCK_TIME(); }}5运行结果：Jcb.txt的内容是：job1 1 88 1job2 3 56 0job31501job42792job52890job621103job71 90 46.心得和思路：通过本次实验，我更深入的了解了进程调度算法！实现了先来先服务算法，优先级调度算法，时间片轮转算法！主要思想如下：（1）先来先服务算法的时候，状态和优先级都没考虑，看成队列的顺序就是