模拟进程调度及银行家算法的实现

{
int i,j;
cout<<"The Max resource is:"<<endl;
for (i = 0; i < 5; i++)
{
cout<<endl;
for (j = 0; j < 3; j++)
cout<<Max[i][j]<<" ";
}
CopyArray (Allocation, AllocationSource);
for (j = 0; j < 5; j++)
if (!bState[j])
return false;
return true;
}
bool Banker (int Need[][3], int Request[],int Available[], int Allocation[][3], int k)
int Allocation[][3] = {2,1,2,4,0,2,4,0,5,2,0,4,3,1,4};
int Need[5][3];
int Available[] = {2,3,3};
int k,j;
int Request[3];
if (1 == choice)
cout<<"process"<<<<" "<<"runtime="<<pcb.runtime <<" "<<"runedtime="<<pcb.runedtime <<" "<<"killtime="<<pcb.killtime ;
cout<<endl;
{
int i;
for (i = 0; i < 5; i++)
if (CompareArray(Need[i],Available) && !bState[i])
{
k = i;
return true;
}
return false;
}
bool Security(int Need[][3], int Available[],int Allocation[][3],int Safety[5])
k = k - 1;
Banker (Need,Request,Available,Allocation,k);
ShowArray (Max,Allocation,Available);
cout<<"请输入选择:(1.继续分配资源 0.退出))"<<endl;
cin>>choice;
}
ProcessRunning (Qready,timeclips);
}
if (2 == choice)
{
ArraySub (Max,Allocation,Need);
ShowArray (Max,Allocation,Available);
{
bool bState[] = {false,false,false,false,false};
int i = 0,j = 0;
int k;
int AvailableSource[3];
int NeedSource[5][3];
int AllocationSource[5][3];
if (Request[i] > Need[i])
return false;
return true;
}
int SubStract (int Available1[],int Available2[])
{
int i;
for (i = 0; i < 3; i++)
Available1[i] = Available1[i] - Available2[i];
return 0;
}
int Plus(int Available1[],int Available2[])
{
int i;
for (i = 0; i < 3; i++)
Available1[i] = Available1[i] + Available2[i];
return 0;
{
int Safety[5];
if (!CompareArray(Request,Need[k]))
{
cout<<"资源不能分配"<<endl;
return false;
}
if (!CompareArray(Request,Available))
{
cout<<"资源不能分配"<<endl;
CopyArray (Need, NeedSource);
CopyArray (Allocation, AllocationSource);
}
return 0;
}
void ShowArray(int Max[][3],int Allocation[][3],int Available[])
}
}
return 0;
}
//bank.cpp
#include "Banker.h"
int ArraySub(int Array1[][3], int Array2[][3], int Array3[][3])
{
int i,j;
for (i = 0; i < 5; i++)
{
cout<<"资源申请成功，存在如下安全序列："<<endl;
for (int i = 0; i < 5; i++)
cout<<"p"<<Safety[i] + 1<<endl;
}
else
{
cout<<"资源申请失败!!!!"<<endl;
Copy (Available, AvailableSource);
{
srand ((int)time(NULL));
InitQueue (Qready);
cout<<"请输入进程数:";
cin>>process;
cout<<"请输入时间片:";
cin>>timeclips;
for (i = 0; i < process; i++)
return false;
}
int AvailableSource[3];
int NeedSource[5][3];
int AllocationSource[5][3];
Copy (AvailableSource,Available);
CopyArray (NeedSource,Need);
for (j = 0; j < 3; j++)
Array3[i][j] = Array1[i][j] - Array2[i][j];
return 0;
}
bool CompareArray(int Request[], int Need[])
{
int i;
for (i = 0; i < 3; i++)
#include "Process.h"
void InitQueue(Queue &Q)
{
Q.head =new Lnode;
Q.head ->next=NULL;
Q.rear =Q.head;
}
void PushNode(Queue &Q, PCB pcb)
{
}
cout<<endl<<endl;
cout<<"The available resource is:";
for (i = 0; i < 3; i++)
cout<<Available[i]<<" ";
cout<<endl<<endl;
}
//process.cpp
}
int Copy (int Available1[],int Available2[])
{
int i;
for (i = 0; i < 3; i++)
Available1[i] = Available2[i];
return 0;
}
int CopyArray(int Array1[][3], int Array2[][3])
int choice;
cout<<"请输入选择:(1.分配资源 0.退出))"<<endl;
cin>>choice;