按序分配资源的算法

#include "stdio.h"
#include "stdlib.h"
#include <iostream.h>
#include <iomanip.h>
#include <time.h>
#include <string>
using namespace std;
#define I 3
{
cout<<"****************************************************************************"<<endl;
cout<<"进程号"<<setw(8)<<"状态"<<setw(15)<<"尚需资源量"<<setw(15)<<" 资源最大需求量"<<setw(15)<<" 已占资源量"<<setw(15)<<"上次申请资源号"<<endl;
for(h=P;h<P+3;h++) //如果等待的资源被释放，将等待态的进程改为就绪态
{
s=R+h->apply-1;
if(s->R_state==0)
{
if(h->state==waiting)
h->state=ready;
#define N 10
int ready=0; //进程为就绪态
int end=1; //进程为完成态
int waiting=2; //进程为等待态
struct PCB
{
int number; //进程号
}
}
cout<<"-----------------【进程"<<q->number<<"成功完成分配!!并释放曾占有的资源】------------------"<<endl<<endl;
h=P;
if(h->state==end&&(h+1)->state==end&&(h+2)->state==end)
for(q=P-1; ;)//控制循环按照进程1、2、3、1...的顺序进行
{
q++;
if(q->state==ready)//顺序选择一个就绪进程
{
if(q->apply==0)//第一次申请资源
{
cout<<endl<<"****请输入进程"<<q->number<<"当前申请的资源号 ("<<q->lapply+1<<"--"<<11-(q->need-q->allocation)<<"): ";
}
for(r=R;r<R+10;r++)//对资源进行初始化
{
m++;
r->R_number=m;
r->R_state=0;
}
for(t=0;t<300;t++)
NUM[t]=0;
t=0;
}
void pri_num()
{
int ta,a;
cout<<"----------------------------------------------------------------------------"<<endl;
for(pr=P;pr<P+3;pr++)
{
cout<<setw(4)<<pr->number<<setw(10);
int state; //状态
int need; //资源最大需求量
int allocation; //资源已占有量
int apply; //当前资源申请号
int lapply; //定义进程上次资源申请号
for(q=P;q<P+3;q++)//对进程进行初始化
{
cout<<" "<<n<<" ";
cin>>q->need;
while(q->need<1||q->need>10)
{
cout<<"输入数据有误,请重新输入: ";
{
cout<<"********************【所有进程都完成,按序算法分配完毕!!!】******************"<<endl;
pri_num();
CHOICE(Y);
return (Y);
}
{
q->lapply=q->apply;
q->apply=0;
r->R_state=q->number;
q->allocation++;
cout<<"****将资源"<<r->R_number<<"分配给了进程"<<q->number<<"! ";
else//进程仍有未完成的，循环
{
if(q==P+2)
q=P-1;
continue;
}
}
else//当前进程的占有量小于资源最大需求量
{
if(q==P+2)
if(pr->state==0) cout<<"就绪";
if(pr->state==1) cout<<"完成";
if(pr->state==2) cout<<"等待";
cout<<setw(10)<<pr->need-pr->allocation<<setw(15)<<pr->need<<setw(15)<<pr->allocation
int choice;
cin>>choice;
while(choice<1||choice>2)
{
cout<<"您的输入有误!请重新选择(1/2):";
cin>>choice;
}
switch(choice)
{
case 1 : Y=1; break;
cin>>q->apply;
NUM[t]=q->apply;
t++;
while(q->apply>10||q->apply<1)
{
cout<<"****您的输入有误,请重新输入("<<q->lapply+1<<"--"<<11-(q->need-q->allocation)<<"): ";
<<setw(15)<<pr->lapply<<endl;
cout<<"----------------------------------------------------------------------------"<<endl;
}
cout<<"****************************************************************************"<<endl;
cout<<endl<<" 【各进程资源申请情况：】"<<endl;
cout<<" ******************************************"<<endl;
cout<<" 进程号: 进程1 进程2 进程3"<<endl;
cin>>q->apply;
}
}
else { 来自++; }
r=R+(q->apply)-1; //指向当前申请的资源
if(q->apply>=q->lapply)//此时为按序申请
{
if(r->R_state==0)//当前申请的资源没被占用
}P[I]; //三个进程
struct RCB
{
int R_number; //资源号