作业调度和低级调度算法2

南京信息工程大学实验（实习）报告实验名称作业调度和低级调度算法实验日期 2011.04.21 得分指导教师毕硕本院计软院专业软件工程年级 09 班次 1 姓名潘银磊学号 200913440441．实验目的：熟悉操作系统作业管理步骤理解作业调度和低级调度算法，并熟练掌握该算法。

2．实验内容：选择四种算法，用计算机语言模拟这四种算法。

1）先来先服务算法2）优先级调度算法3）最短作业优先算法4）轮转调度算法算法3．实验步骤1）先来先服务算法#include<stdio.h>#include<stdlib.h>#include<iostream.h>#define maxsize 100void FCFS(int array[],int m){int sum=0,j;printf("\nFCFS: ");for(int i=0;i<m;i++){printf("%5d",array[i]);}for(i=0,j=1;j<m;i++,j++){if(array[i]<array[j]) sum+=(array[j]-array[i]);else sum+=(array[i]-array[j]);}printf("\n移动的总道数：");printf("%d",sum);}void ShortPath(int array[],int m){int temp;int now,pos;int i,j,sum=0,k;for(i=0;i<m;i++)for(j=i+1;j<m;j++){if(array[i]>array[j]){temp=array[i];array[i]=array[j];array[j]=temp;}}cout<<"请输入当前的磁道号：";cin>>now;for(i=0;i<m;i++){if(array[i]>=now){pos=i;break;}}printf("\nShortPath: ");if(i==0){for(int i=0;i<m;i++){printf("%5d",array[i]);}for(i=0,j=1;j<m;i++,j++){if(array[i]<array[j]) sum+=(array[j]-array[i]);else sum+=(array[i]-array[j]);}}else{if(i-1==m-1){for(int i=m-1;i>=0;i--){printf("%5d",array[i]);}for(i=m-1,j=m-2;j>=0;i--,j--){if(array[i]<array[j]) sum+=(array[j]-array[i]);else sum+=(array[i]-array[j]);}}else{if(array[i]==now) // {printf("%d",array[i]);now=array[i];for(k=i;k<m;k++)array[i]=array[i+1];m--;pos=i+1;goto kk;}else{while(m){sum=0;if((now-array[pos-1])<(array[pos]-now)){// sum+=now-array[pos-1];printf("%5d",array[pos-1]);now=array[pos-1];if(pos-1>=m){for(k=pos-1;k>0;k--)array[k]=array[k-1];}elsefor(k=pos-1;k<=m-1;k++)array[k]=array[k+1];//pos=pos;m--;}else{//sum+=array[pos]-now;printf("%5d",array[pos-1]);now=array[pos];if(pos>=m){for(k=pos;k>=0;k--)array[k]=array[k-1];}elsefor(k=pos;k<=m-1;k++)array[pos]=array[pos+1];//pos=pos+1;m--;}}}}}// printf("\n移动的总道数：");// printf("%d",sum);}void Elevator(int array[],int m){int pos,now,d,sum=0,j,temp,i;for(i=0;i<m;i++)for(j=i+1;j<m;j++){if(array[i]>array[j]){temp=array[i];array[i]=array[j];array[j]=temp;}}cout<<"请输入当前的磁道号：";cin>>now;cout<<endl;for(i=0;i<m;i++){if(now==array[i])break;}pos=i;cout<<"请输入当前移动臂的移动的方向(1 表示向内，0表示向外) : ";cin>>d;printf(" Elevator : ");if(d==1){for(i=pos,j=pos+1;i<m;i++){printf("%5d",array[i]);if(array[i]>array[j]) sum+=(array[i]-array[j]);else sum+=(array[j]-array[i]);}for(i=pos-1;i>=0;i--){printf("%5d",array[i]);if(array[i]>array[j]) sum+=(array[i]-array[j]);else sum+=(array[j]-array[i]);}}if(d==0){for(i=pos,j=pos+1;i>=0;i--){printf("%5d",array[i]);if(array[i]>array[j]) sum+=(array[i]-array[j]);else sum+=(array[j]-array[i]);}for(i=pos+1,j=pos+2;i<m;i++){printf("%5d",array[i]);if(array[i]>array[j]) sum+=(array[i]-array[j]);else sum+=(array[j]-array[i]);}}if((d!=1)&&(d!=0))cout<<endl<<"input error!"<<endl;printf("\n移动的总道数：");printf("%d",sum);}void SCAN(int array[],int m){int pos,now,sum=0,j,temp,i;for(i=0;i<m;i++)for(j=i+1;j<m;j++){if(array[i]>array[j]){temp=array[i];array[i]=array[j];array[j]=temp;}}cout<<"请输入当前的磁道号：";cin>>now;cout<<endl;for(i=0;i<m;i++){if(now==array[i])break;}pos=i;printf(" SCAN : ");for(i=pos,j=pos+1;i<m;i++){printf("%5d",array[i]);if(array[i]>array[j]) sum+=(array[i]-array[j]);else sum+=(array[j]-array[i]);}for(i=0,j=1;i<pos;i++){printf("%5d",array[i]);if(array[i]>array[j]) sum+=(array[i]-array[j]);else sum+=(array[j]-array[i]); }printf("\n移动的总道数：");printf("%d",sum);}void main(){int c;FILE *fp;int cidao[maxsize];int i=0,count;fp=fopen("cidao.txt","r+");if(fp==NULL){cout<<"can not find file!"<<endl;exit(0);}while(!feof(fp)){fscanf(fp,"%d",&cidao[i]);i++;}count=i-1;for(i=0;i<count;i++){printf("%5d",cidao[i]);}cout<<endl;while(1){cout<<endl<<"系统的菜单如下："<<endl;printf("1. 先来先服务 2. 最短寻道时间优先 3. 电梯调度"); cout<<endl;printf("4. 单向扫描 5. 退出");cout<<endl;cout<<"请选择：";cin>>c;if(c>4)break;switch(c){case 1:FCFS(cidao,count);break;case 2:ShortPath(cidao,count);break;case 3:Elevator(cidao,count);break;case 4:SCAN(cidao,count);break;}}}2）优先级调度算法#include <stdio.h>#include <conio.h>#define N 20struct PCB{char pname[N];int pro;char state;int runtime;struct PCB *next;};struct PCB *head_input;struct PCB *head_run;struct PCB *head_run_pre;unsigned long current;int readydata(){if(head_input->next==NULL){return 0;}struct PCB *p1=head_input->next,*pmax,*p2;int maxpro=0xffff;pmax=p1;p2=head_input;//head_run_pre=head_input;while(p1!=NULL){if(p1->pro<maxpro){maxpro=p1->pro;head_run_pre=p2;pmax=p1;}p2=p1;p1=p1->next;}head_run=pmax;head_run_pre->next=head_run->next;return 1;}void runprocess(){head_run->runtime-=10;head_run->pro++;struct PCB *p1,*p2;printf("Time slice is %d",current);current+=10;printf(" %s starts\n",head_run->pname);printf("Time slice is %d",current);printf(" %s ends\n",head_run->pname);if(head_run->runtime<=0){//判断进程是否运行结束// delete(*head->run);}else{p1=head_input;p2=head_input->next;p1->next=head_run;head_run->next=p2;}}int readyprocess(){while(1){if(readydata()==0)return 0;else runprocess();}}void Init(){head_input=new PCB;head_input->next=NULL;current=0;int numpro;printf("请输入要建立的进程数:\n\n");scanf("%d",&numpro);printf("please input the information of the processes\n");printf("process 进程名******运行时间******权值\n");for(int i=0;i<numpro;i++){//printf("please input the %d-th process's information:\n",i+1);struct PCB *p1=new PCB;scanf("%s",p1->pname);scanf("%d",&p1->runtime);scanf("%d",&p1->pro);p1->state='C';p1->next=NULL;struct PCB *p2=head_input->next;head_input->next=p1;p1->next=p2;}}int main(){printf("*******xxxxxxxxxxxxxxx********\n\n");Init();printf("优先级调度算法运行结果如下:\n");readyprocess();return 0;}3）最短作业优先算法public class Job {private String name = "";private String inTime = "";private int maybeRunTime = 0;private int waitTime = 0;private int turnoverTime = 0;private int withPoweroverTime = 0;public int getTurnoverTime() {return turnoverTime;}public void setTurnoverTime(int turnoverTime) {this.turnoverTime = turnoverTime;}public int getWithPoweroverTime() {return withPoweroverTime;}public void setWithPoweroverTime(int withPoweroverTime) { this.withPoweroverTime = withPoweroverTime;}public String getInTime() {return inTime;}public void setInTime(String inTime) {this.inTime = inTime;}public int getMaybeRunTime() {return maybeRunTime;}public void setMaybeRunTime(int maybeRunTime) {this.maybeRunTime = maybeRunTime;}public String getName() {return name;}public void setName(String name) { = name;}public int getWaitTime() {return waitTime;}public void setWaitTime(int waitTime) {this.waitTime = waitTime;}}4）轮转调度算法#include <stdio.h>#define M 5 //物理页数#define Myprintf printf("|---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---+---|\n")typedef struct PCB{int ID;int ReachTime;int TotalTime;}PCB; //进程号，到达时间和服务时间typedef struct NOTE //备份{int ID;int TotalTime;}NOTE;PCB A[M]; //5个进程PCB a[M];NOTE temp;int queue[50]; //记录调度的进程int K=0; //调度进程数组的标识void INIT()//初始化{int i;for(i=0;i<M;i++){A[i].ID=-1;}}int GetNum()//计算进程数{int i,j=0;for(i=0;i<M;i++){if(A[i].ID!=-1){j++;}}return j;}int GetReach(int time)//找出到达进程号{int i;for(i=0;i<M;i++){if(a[i].ReachTime<=time){a[i].ReachTime=100;return i;}}return -1;}int GetInsert()//找出插入位置{int i;for(i=0;i<M;i++){if(A[i].ID==-1)return i;}return -1;}void Forward(int num)//前移{int i;for(i=0;i<num-1;i++){A[i].ID=A[i+1].ID;A[i].TotalTime=A[i+1].TotalTime;}A[num-1].ID=-1;}void Process()//执行进程{queue[K]=A[0].ID;K++;A[0].TotalTime--;temp.ID=A[0].ID;temp.TotalTime=A[0].TotalTime;}void main(){int i;int time;int t=0;int reach;int insert;int num;printf("RR算法\n\n");INIT();for(i=0;i<M;i++){printf("请输入进程ID：");scanf("%d",&a[i].ID);printf("请输入到达时间：");scanf("%d",&a[i].ReachTime);printf("请输入服务时间：");scanf("%d",&a[i].TotalTime);}for(i=0;i<M;i++)//运行时间{t=t+a[i].TotalTime;}for(i=0;i<50;i++)//初始化{queue[i]=-1;}for(time=0;time<=t;time++){reach=GetReach(time);if(reach!=-1)//有进程到达{insert=GetInsert();A[insert].ID=a[reach].ID;A[insert].TotalTime=a[reach].TotalTime;num=GetNum();continue;//进程数为1else{//进程数不为1Process();Forward(num);if(temp.TotalTime!=0){A[num-1].ID=temp.ID;A[num-1].TotalTime=temp.TotalTime;}}}else//没有进程到达{num=GetNum();if(num==1){//进程数为1Process();if(temp.TotalTime==0){A[0].ID=-1;}}else if(num==0)continue;//进程数为0else{Process();Forward(num);if(temp.TotalTime!=0){A[num-1].ID=temp.ID;A[num-1].TotalTime=temp.TotalTime;}}}}printf("\n");printf("调度顺序为：\n");Myprintf;for(i=0;i<50;i++){printf("|%2d ",queue[i]);}printf("|\n");Myprintf;printf("\n");}。