操作系统实验报告

操作系统实验报告一、实验目的1、处理机调度：在多道程序或多任务系统中，系统中同时处于就绪状态有若干，也就是说能运行的进程数远远大于处理机个数。

为了使系统中的各进程能有条不紊地运行，必须选择某种调度策略，以选择一进程占用处理机。

2、银行家算法：模拟进程的资源分配算法，了解死锁的产生和避免。

3、页面替换：在分页虚拟存储系统中，当硬件发出缺页中断后转操作系统处理缺页中断。

如果主存中已无空闲块，采用合适算法进行缺页处理。

4、移臂调度：在启动之前按驱动调度策略对访问的请求优化其排序十分必要。

就应该考虑使移动臂的移动时间最短的调度策略。

将上述算法放在一个程序中进行调度，就是本次课程设计的主要内容。

二、实验要求书写实验报告，应该包括以下几项内容：1、实验题目2、程序中使用的数据结构及主要符号说明。

3、程序流程图和带有注释的源程序。

4、执行程序名，并打印程序运行时的初值和运行结果，其中包括：I、各程序进程块的初始状态。

II、选中运行进程的名字、运行后各进程控制块状态以及每次调度时，就绪队列的进程排列顺序。

5、通过实验后的收获和体会及对实验的改进意见和见解。

三、实验内容该程序中包括了处理机调度、页面置换算法、移臂调度算法；这三种算法中各包含了三种调度方式。

最后还有银行家算法。

四、实验结果展示1、初始界面如下2、处理机调度过程3、页面替换调度的界面4、银行家算法界面5、移臂调度界面五、实验收获与体会本次课程设计将平时做的实验综合在一起，通过界面的控制来调度不同的算法，实现不同的目的。

当初单个实验执行没有错误，放在一起就出现了很多问题，比如重定义问题，整个实验中也只能出现一个main( )函数。

通过本次课程设计，收获颇多，当调出没错误时，一种前所未有的成就感油然而生，同时也对各种算法有了更深层次的认识。

附录：源程序：#include<iostream>#include<iomanip>using namespace std;struct PCB1{char name[20]; //进程名int arrivetime; //进程到达时间int runtime; //估计运行时间int grade; //进程的优先级（优先数越低，优先级越高）PCB1 *next; //链表指针};class processes{ PCB1 *head;//指向初始化的进程队列PCB1 *run;//指向就绪进程队列，队首为正在运行的进程PCB1 *run_tail;//指向就绪队列队尾int num;//记录进程个数int current;//记录系统当前时间的变量public:processes(int n);//构造函数processes::~processes();//析构函数void Set_Run();//run为空时初始化或构造run链表void Move1();//run队列队首结点移至队尾void Move2();//head队首元素移至run队首void Move3();//进程运行后优先级改变且未运行完成有序插入就绪队列PCB1* Sort_Insert_arrivetime(PCB1 *head,PCB1 *n);//按到达时间排序void inputprocess(int l);//建立进程的函数void Delete_processes();//构造已完成的进程队列void runprocess_FCFS();//先来先服务算法void runprocess_RR();//时间片轮算法void runprocess_Grade();//按优先级调度};processes::processes(int n)//构造函数{ num=n;current=0;run=head=NULL;}processes::~processes()//析构函数{ delete head,run,run_tail;}void processes::Set_Run(){ run=head;run_tail=head;head=head->next;run->next=NULL;}void processes::Move1(){ PCB1 *just_run=run;run=run->next;run_tail->next=just_run;just_run->next=NULL;run_tail=just_run;}void processes::Move2(){ PCB1 *t=head;head=head->next;t->next=run;run=t;}void processes::Move3(){ PCB1 *just_run=run;run=run->next;PCB1 *r=run,*q=run->next;while(q&&just_run->grade>=q->grade) r=q,q=q->next;r->next=just_run;just_run->next=q;if(!q) run_tail=just_run;}PCB1* processes::Sort_Insert_arrivetime(PCB1 *head,PCB1 *n)//按到达时间排序{ PCB1 *p1,*p2;if(head==NULL){head=n;n->next=NULL;return head;}if(head->arrivetime>=n->arrivetime){n->next=head;head=n;return head;}p1=p2=head;while(p2->next&&p2->arrivetime<n->arrivetime){p1=p2;p2=p2->next;}if(p2->arrivetime<n->arrivetime){p2->next=n;n->next=NULL;}else if(p2->arrivetime>n->arrivetime){n->next=p2;p1->next=n;}else{while(p2->grade<n->grade) {p1=p2,p2=p2->next;}p1->next=n;n->next=p2;}return head;}void processes::inputprocess(int l)//建立进程的函数{ for(int i=0;i<num;i++){PCB1 *n=new PCB1;cout<<"\nInput NO."<<i+1<<" process name:";cin>>n->name;cout<<" arrivetime:";cin>>n->arrivetime;cout<<" runtime:";cin>>n->runtime;if(l==3) cout<<" grade:",cin>>n->grade;else n->grade=0;head=Sort_Insert_arrivetime(head,n);}}void processes::Delete_processes()//构造已完成的进程队列{ PCB1 *p=run;run=run->next;delete p;}void processes::runprocess_FCFS()//先来先服务算法{ int start_time,k=0;while(head){while(current<head->arrivetime) current++;run=head;if(!k){cout<<"Time is "<<current;start_time=head->arrivetime;}else start_time=current;cout<<","<<run->name<<" start"<<endl;while(current<start_time+run->runtime) current++;cout<<"Time is "<<current<<","<<run->name<<" end";run->runtime=0;head=head->next;Delete_processes();if(head&&current>=head->arrivetime) k=1;else {cout<<'\n';k=0;}}}void processes::runprocess_RR()//时间片轮算法{ for(int k=0;head||run;k=0){if(!run&&head){while(current<head->arrivetime) current++;Set_Run();cout<<"Time is "<<current<<","<<run->name<<" start"<<endl;}run->runtime--,current++;if(run->runtime==0){cout<<"Time is "<<current<<","<<run->name<<" end";Delete_processes();if(head&&current==head->arrivetime) k=1;else {cout<<'\n';if(!run&&!head) break;}}if(head==NULL||(head&&current<head->arrivetime))if(run&&run->next) Move1();if(head&&current==head->arrivetime){if(!k&&run&&run->next) Move1();if(run) Move2();else Set_Run();if(!k) cout<<"Time is "<<current;cout<<","<<run->name<<" start"<<endl;}}}void processes::runprocess_Grade()//按优先级调度{ for(int k=0;head||run;k=0){if(!run&&head){while(current<head->arrivetime) current++;Set_Run();cout<<"Time is "<<current<<","<<run->name<<" start"<<endl;}run->runtime--,current++,run->grade++;if(run->runtime==0){cout<<"Time is "<<current<<","<<run->name<<" end";Delete_processes();if(head&&current>=head->arrivetime) k=1;else {cout<<'\n';if(!run&&!head) break;}}if(!head||current<head->arrivetime)if(run&&run->next&&run->grade>run->next->grade) Move3();if(head&&current>=head->arrivetime){if(!run){Set_Run();cout<<","<<run->name<<" start"<<endl;}else{if(run->next&&run->grade>run->next->grade) Move3();if(head->grade>=run->grade){if(k) cout<<'\n';}else{Move2();if(!k) cout<<"Time is "<<current;cout<<","<<run->name<<" start"<<endl;}}}}}int cljdd(){int m,n;while(1){cout<<"*********************************处理器调度方法*********************************\n"<<"1.先来先服务\n\n"<<"2.时间片轮转法\n\n"<<"3.优先级法\n\n"<<"4.退出\n\n"<<"****************************************************************** **************"<<"\n请选择需要的调度方法：";cin>>n;while(n<1||n>3){if(n==4) return 1;cout<<"输入有误!请重新输入：";cin>>n;}cout<<"\n请输入进程的个数：";cin>>m;processes P(m);P.inputprocess(n);if(n==1) P.runprocess_FCFS();else if(n==2) P.runprocess_RR();else P.runprocess_Grade();}}//************************************ 页面替换*************************************class Page{ int pagecount;//记录需要访问的页面次数int blockcount;//记录内存块大小int head;int t;int *page;int **block;public:Page(int m,int n);~Page();void setpage();int seekpage(int i);int isfull();void FIFO(int i);void LRU(int i);void OPT(int i);void queyediaodu(int r);};Page::Page(int m,int n):pagecount(n),blockcount(m){head=t=0;page=new int[pagecount];block=new int*[blockcount];for(int i=0;i<blockcount;i++) block[i]=new int[2];}Page::~Page(){delete page;for(int i=0;i<blockcount;i++) delete block[i];delete block;}void Page::setpage(){cout<<"输入页面走向：";for(int i=0;i<pagecount;i++) cin>>page[i];for(i=0;i<blockcount;i++)block[i][0]=-1,block[i][1]=0;}int Page::seekpage(int i){for(int l=0;l<blockcount;l++)if(block[l][0]==i) return l;return -1;}int Page::isfull(){for(int i=0;i<blockcount;i++)if(block[i][0]==-1) return i;return -1;}void Page::FIFO(int i)//head的下一个页面被替换{head=(head+1)%blockcount;t=head;cout<<"\n页面"<<block[t][0]<<"被替换，"<<page[i]<<"装入\n";if(block[t][1]==1) cout<<"将页面"<<block[t][0]<<"复写入交换区\n"; }void Page::LRU(int i)//head前一个被替换{if(head==0) t=blockcount-1;else t=head-1;cout<<"\n页面"<<block[t][0]<<"被替换，"<<page[i]<<"装入\n";if(block[t][1]==1) cout<<"将页面"<<block[t][0]<<"复写入交换区\n";head=t;}void Page::OPT(int i){int *q,d=-1;q=new int[blockcount];for(int j=0;j<blockcount;j++) q[j]=pagecount;for(int k=0;k<blockcount;k++)for(int l=pagecount-1;l>i;l--)if(block[k][0]==page[l]) q[k]=l;for(int h=0;h<blockcount;h++)if(q[h]>d) d=q[h],t=h;cout<<"\n页面"<<block[t][0]<<"被替换，"<<page[i]<<"装入\n";if(block[t][1]==1) cout<<"将页面"<<block[t][0]<<"复写入交换区\n"; }void Page::queyediaodu(int r){int i,tag=0;char a;for(i=0;i<pagecount;i++,tag=0){if((t=seekpage(page[i]))>=0){cout<<"\n页面"<<page[i]<<"命中！\n";if(r==2) head=t;tag=1;}else{if((t=isfull())>=0){cout<<"\n内存足够大，页面"<<page[i]<<"被写入\n";head=t;}else{if(r==1) FIFO(i);else if(r==2) LRU(i);else if(r==3) OPT(i);}block[t][0]=page[i];}char b=true;while(b){cout<<"是否有数据修改(Y/N)？";cin>>a;if(a=='y'||a=='Y') block[t][1]=1,b=false;else if(a=='n'||a=='N'){if(tag==0) block[t][1]=0;b=false;}else cout<<"输入有误！请重新输入\n";}}}int ymth(){int m,n,s;while(1){cout<<"*********************************页面替换策略***********************************\n"<<"1.先进先出页面替换策略\n\n"<<"2.最近最少使用页面替换策略\n\n"<<"3.最佳页面替换算法\n\n"<<"4.退出\n\n"<<"****************************************************************** **************"<<"\n请选择页面替换策略：";cin>>s;while(s<1||s>3){if(s==4) return 1;cout<<"输入有误，请重新输入：";cin>>s;}cout<<"输入内存块数：";cin>>m;cout<<"输入页面数：";cin>>n;Page P(m,n);P.setpage();P.queyediaodu(s);}}//**********************************银行家算法***********************************const int max_resource=10;//系统拥有最大资源数struct PCB{ char name[21];//记录进程的名字int requirement;//进程所需资源总量int occupy;//进程已占资源量char state;//进程状态标志PCB *next;//用于指向下一个结点};class Banker{ PCB *head;//运行态进程队首PCB *tail;//运行态进程队尾PCB *run;//指向正在运行进程PCB *wait_head;//等待态进程队首PCB *wait_tail;//等待态进程队尾int rest_resource;//系统剩余资源量int num;//系统运行进程的个数public:Banker(int m);//构造函数~Banker();//析构函数void inputprocesses();//建立进程的函数PCB* Get_run(char *n);//寻找与输入名一样的进程void Delete(PCB *n);//删除已完成运行的进程void Sort_processes1(PCB *p1,PCB *p2);//置进程为就绪态 void Sort_processes2(PCB *r);//置进程为等待态bool isSafeState();//安全性测试算法void rand();//随机算法void banker();//银行家算法};Banker::Banker(int m){ num=m;head=wait_head=NULL;rest_resource=max_resource;}Banker::~Banker(){ delete head,tail,run,wait_tail;if(wait_head){ PCB *p=wait_head;wait_head=wait_head->next;delete p;}}void Banker::inputprocesses(){ cout<<"\nEnter the information of processes：\n";for(int i=0;i<num;i++){ PCB *n=new PCB;cout<<"\nEnter the name of process:";cin>>n->name;cout<<"Enter the requested resoures of process:";cin>>n->requirement;if(n->requirement>max_resource){ cout<<"进程申请资源量超过系统拥有总量，重新输入！\n";delete n;i--;}else{ n->occupy=0;n->state=false;if(!head) tail=head=n;else tail->next=n,tail=n;}}if(head) tail->next=NULL;}PCB* Banker::Get_run(char *n){ PCB *t=head;while(t){ if(!strcmp(t->name,n)) return t;t=t->next;}t=wait_head;while(t){ if(!strcmp(t->name,n)){cout<<"This process is waiting\n";return NULL;}t=t->next;}cout<<"The processs_name is wrong！Enter again\n";return t;}void Banker::Delete(PCB *n){ PCB *p1,*p2;if(!strcmp(head->name,n->name)){ p1=head;head=head->next;delete p1;}else{ p1=head,p2=p1->next;while(strcmp(p2->name,n->name)) p1=p2,p2=p2->next;if(!p2->next) tail=p1;p1->next=p2->next;delete p2;}}void Banker::Sort_processes1(PCB *p1,PCB *p2){ if(!p2->next) wait_tail=p1;p1->next=p2->next;if(p1==p2) wait_head=wait_head->next;if(head) tail->next=p2,tail=p2;else head=tail=p2;p2->next=NULL;}void Banker::Sort_processes2(PCB *r){ PCB *q1,*q2;q1=q2=head;while(strcmp(r->name,q2->name)) q1=q2,q2=q2->next;if(q1==q2) head=head->next;if(!q2->next) tail=q1;q1->next=q2->next;if(wait_head) wait_tail->next=q2,wait_tail=q2;else wait_head=wait_tail=q2;q2->next=NULL;}bool Banker::isSafeState(){ int currentavail=rest_resource;bool possible=true;PCB *p1=head,*p2=tail;if(wait_head){ tail->next=wait_head;p2=wait_tail;}while(p1!=p2) p1->state=false,p1=p1->next;p1->state=false;for(p1=head;p1;){ if(p1->state) {p1=p1->next;continue;}if(p1->requirement-p1->occupy>currentavail) {p1=p1->next;continue; }else{ currentavail+=p1->occupy;p1->state=true;p1=head;continue;}}for(p1=head;p1;p1=p1->next){ if(p1->state) continue;else {possible=false;break;}}if(wait_head) tail->next=NULL;return possible;}void Banker::rand(){ cout<<"\nNow start random alogrithm...\n";char n[20];int x;PCB *p1,*p2;while(head||wait_head){ cout<<"\nEnter the name of process:";cin>>n;if(!(run=Get_run(n))) continue;cout<<"Enter the resquest for the process:";cin>>x;if(x>run->requirement-run->occupy){cout<<"beyond the real need！Enter again\n";continue;}if(x<=rest_resource){ rest_resource-=x;run->occupy+=x;cout<<x<<" resources are accepted for "<<run->name<<'\n';if(run->requirement-run->occupy==0){ rest_resource+=run->occupy;cout<<run->name<<" has completed!\n";Delete(run);if(wait_head){ p1=p2=wait_head;while(p2&&p2->requirement-p2->occupy>rest_resource) p1=p2,p2=p2->next;if(p2) {Sort_processes1(p1,p2);continue;}elselp:{if(head) continue;else {cout<<'\n'<<"System locked!\n";break;}}}elseelse continue;}}else continue;}else{ cout<<run->name<<" is waiting\n";Sort_processes2(run);goto lp;}}}void Banker::banker(){ cout<<"\nNow start random alogrithm...\n";char n[20];int x;PCB *p1,*p2;while(head||wait_head){ cout<<"\nEnter the name of process:";cin>>n;if(!(run=Get_run(n))) continue;cout<<"Enter the resquest for the process:";cin>>x;if(x>run->requirement-run->occupy){cout<<"beyond the real need！Enter again\n";continue;}if(x<=rest_resource){ rest_resource-=x;run->occupy+=x;if(isSafeState()){ cout<<x<<" resources are accepted for "<<run->name<<'\n';if(run->requirement-run->occupy==0){ rest_resource+=run->occupy;cout<<run->name<<" has completed!\n";Delete(run);if(wait_head){ p1=p2=wait_head;while(p2&&p2->requirement-p2->occupy>rest_resource) p1=p2,p2=p2->next;if(p2) {Sort_processes1(p1,p2);continue;}else continue;}elseelse continue;}}else continue;}else{ rest_resource+=x;run->occupy-=x;cout<<run->name<<" is waiting\n";Sort_processes2(run);continue;}}else{ cout<<run->name<<" is waiting\n";Sort_processes2(run);continue;}}}void yhjsf(){cout<<"**************************欢迎使用银行家算法****************************\n";cout<<"System's max_resource are 10\n";int m;cout<<"Enter the number of processes:";cin>>m;while(m>10) {cout<<"\nThe number of processes is beyond the system,Enter again!\n";cin>>m;}Banker B(m);B.inputprocesses();char t;while(1){ cout<<"\nPlease select a algorithm:\nRandom(R) or Bnaker(B)\n";cin>>t;if(t=='r'||t=='R') {B.rand();break;}if(t=='b'||t=='B') {B.banker();break;}else cout<<"\nEntering is wrong!Enter again\n";}}//*************************移臂调度算法**********************void BubbleSort(int *a,int size){int t;for(int z=1;z<size;z++)for(int j=0;j<size-z;j++)if(a[j]>a[j+1]){t=a[j];a[j]=a[j+1];a[j+1]=t;}}int SearchKez1(int *a,int size,int kez){int z=0;while(kez>a[z])z++;return z;}int SearchKez2(int *a,int size,int now,int z){ int x;for( z=0;z<size;z++)if(a[z]!=-1){if(abs(a[z]-now)<z){z=abs(a[z]-now);x=a[z];z=z;}}a[z]=-1;return x;}int ybdd(){cout<<"******************************欢迎使用移臂算法**********************************\n";char a;cout<<"1、采用先来先服务算法（FCFS）\n";cout<<"2、采用电梯算法（EA）\n";cout<<"3、采用最短查找时间优先算法（SSTF）\n";int m;cout<<"输入选择的调度算法:";cin>>m;do{int size,now;int *p;cout<<"\n请输入请求队列的个数：";cin>>size;p=new int[size];cout<<"\n请输入请求队列：";for(int z=0;z<size;z++)cin>>p[z];cout<<"\n请输入当前磁头位置：";cin>>now;cout<<"\n请输入磁头移动方向（向磁道号减小方向请按N，增加方向请按z）：";cin>>a;while(a!='z'&&a!='z'&&a!='N'&&a!='n'){cout<<"\n输入有误，请重新输入：";cin>>a;}if(m==1){cout<<"\n采用先来先服务算法（FCFS）的响应序列是：\n";cout<<now;for( z=0;z<size;z++)cout<<"-->"<<p[z];cout<<'\n';}BubbleSort(p,size);int t=SearchKez1(p,size,now);if(m==2){cout<<"\n采用电梯算法（EA）的响应序列是：\n";cout<<now;if(a=='N'||a=='n'){for(z=t;z>=0;z--)cout<<"-->"<<p[z];for( z=t+1;z<size;z++)cout<<"-->"<<p[z];}if(a=='z'||a=='z'){for( z=t+1;z<size;z++)cout<<"-->"<<p[z];for( z=t;z>=0;z--)cout<<"-->"<<p[z];}cout<<'\n';}if(m==3){cout<<"\n采用最短查找时间优先算法（SSTF）的响应序列是：\n";cout<<now;z=p[size-1]-p[0];for( z=0;z<size;z++){now=SearchKez2(p,size,now,z);cout<<"-->"<<now;}cout<<'\n';}cout<<"是否继续使用？（z/N）：";cin>>a;}while(a=='z'||a=='z');return 0;}//***************************************************************** ******int main(void){ cout<<"***********************欢迎使用算法导航**************************\n";cout<<"算法类型:\n";cout<<"一、处理机调度\n";cout<<"二、页面替换\n";cout<<"三、银行家算法\n";cout<<"四、移臂调度\n";int x;cout<<"选择你想执行的算法：";cin>>x;if(x==1){cout<<"一、处理机调度:\n";//*******************处理机调度********************cljdd();}if(x==2){cout<<"二、页面替换：\n";//*******************页面替换***********************ymth();}if(x==3){cout<<"三、银行家算法：\n";//*******************银行家算法*********************yhjsf();}if(x==4){cout<<"四、移臂调度:\n";//*******************移臂调度*********************** ybdd();}return 0;}。