操作系统实验之银行家算法模拟
- 银行家算法中的数据结构
- 可利用资源向量 Available
Available[i] 表示第 i 种资源可利用的数目 - 最大需求矩阵 Max
Max[i][j] 表示第 i 个进程最多需要的第 j 类资源的数目 - 分配矩阵 Allocation
Allocation[i][j] 表示第 i 个进程已经占有的第 j 类资源的数目 - 需求矩阵 Need
Need[i][j] 表示第 i 个进程还需要的第 j 类资源的数量
- 详细介绍
- 代码:
#include<cstdio>
#include<iostream>
#include<queue>
#include<cstring>
using namespace std;
const int MAX_RESOURCES_NUM = 100;
const int MAX_PROCESS_NUM = 100;
queue<int> SecuritySequence;
struct SYSTEM
{
int Finish[MAX_PROCESS_NUM];
int Available[MAX_RESOURCES_NUM];
int Max[MAX_PROCESS_NUM][MAX_RESOURCES_NUM];
int Allocation[MAX_PROCESS_NUM][MAX_RESOURCES_NUM];
int Need[MAX_PROCESS_NUM][MAX_RESOURCES_NUM];
};
int IsSafe(SYSTEM status,int process_num,int resources_num)
{
while(!SecuritySequence.empty())
SecuritySequence.pop();
for(int i = 0; i < process_num; i++)
{
int have_process = 0;
for(int j = 0; j < process_num; j++)
{
if(status.Finish[j] == 0)
{
int success = 1;
for(int k = 0; k < resources_num; k++)
{
if(status.Available[k] < status.Need[j][k])
{
success = 0;
break;
}
}
if(success == 1)
{
have_process = 1;
status.Finish[j] = 1;
for(int l = 0; l < resources_num; l++)
{
status.Available[l] += status.Allocation[j][l];
}
SecuritySequence.push(j);
}
}
}
if(have_process == 0)
{
break;
}
}
int is_safe = 1;
for(int i = 0; i < process_num; i++)
{
if(status.Finish[i] == 0)
is_safe = 0;
}
return is_safe;
}
int BankerAlgorithm(SYSTEM status,int process_num,int resources_num,int process,int Request[])
{
for(int i = 0; i < resources_num; i++)
{
if(Request[i] > status.Need[process][i])
{
printf("需求资源大于最大需求\n");
return 0;
}
}
for(int i = 0; i < resources_num; i++)
{
if(Request[i] > status.Available[i])
{
printf("需求资源大于可分配资源\n");
return 0;
}
}
for(int i = 0; i < resources_num; i++)
{
status.Available[i] -= Request[i];
status.Allocation[process][i] += Request[i];
status.Need[process][i] -= Request[i];
}
if(IsSafe(status,process_num,resources_num))
{
printf("存在安全序列:\n");
while(!SecuritySequence.empty())
{
printf("%d ",SecuritySequence.front());
SecuritySequence.pop();
}
return 1;
}
else
{
printf("不存在安全序列,不分配资源\n");
for(int i = 0; i < resources_num; i++)
{
status.Available[i] += Request[i];
status.Allocation[process][i] -= Request[i];
status.Need[process][i] += Request[i];
return 0;
}
}
}
void display(SYSTEM status,int process_num,int resources_num)
{
printf("系统状态Available:\n");
for(int i = 0; i < resources_num; i++)
printf("%d ",status.Available[i]);
putchar('\n');
printf("请初始化系统状态最大需求矩阵Max:\n");
for(int i = 0; i < process_num; i++)
{
for(int j = 0; j < resources_num; j++)
{
printf("%d ",status.Max[i][j]);
}
putchar('\n');
}
printf("可利用资源向量Allocation:\n");
for(int i = 0; i < process_num; i++)
{
for(int j = 0; j < resources_num; j++)
{
printf("%d ",status.Allocation[i][j]);
}
putchar('\n');
}
printf("需求矩阵Need\n");
for(int i = 0; i < process_num; i++)
{
for(int j = 0; j < resources_num; j++)
{
printf("%d ",status.Need[i][j]);
}
putchar('\n');
}
}
int main(int argc, char* argv[])
{
SYSTEM status;
int resources_num,process_num;
printf("请初始化进程数,和资源种数:\n");
scanf("%d %d",&process_num,&resources_num);
printf("请初始化系统状态Available:\n");
for(int i = 0; i < resources_num; i++)
scanf("%d",&status.Available[i]);
printf("请初始化系统状态最大需求矩阵Max:\n");
for(int i = 0; i < process_num; i++)
{
for(int j = 0; j < resources_num; j++)
{
scanf("%d",&status.Max[i][j]);
}
}
printf("请初始化可利用资源向量Allocation:\n");
for(int i = 0; i < process_num; i++)
{
for(int j = 0; j < resources_num; j++)
{
scanf("%d",&status.Allocation[i][j]);
}
}
for(int i = 0; i < process_num; i++)
{
for(int j = 0; j < resources_num; j++)
{
status.Need[i][j] = status.Max[i][j] - status.Allocation[i][j];
}
}
int process;
int Request[MAX_RESOURCES_NUM];
if(IsSafe(status,process_num,resources_num) == 0)
{
printf("初始状态不存在安全序列\n");
return 0;
}
else
{
printf("初始状态安全\n");
printf("存在安全序列:\n");
while(!SecuritySequence.empty())
{
printf("%d ",SecuritySequence.front());
SecuritySequence.pop();
}
putchar('\n');
}
while(1)
{
display(status,process_num,resources_num);
printf("请输入资源请求:process\n");
int process;
int Request[MAX_RESOURCES_NUM];
scanf("%d",&process);
if(process == -1)
break;
printf("请输入资源请求:Request[](the length of the Request is that of resources_num)\n");
for(int i = 0; i < resources_num; i++)
{
scanf("%d",&Request[i]);
}
if(BankerAlgorithm(status,process_num,resources_num,process,Request) == 1)
{
int process_end = 1;
for(int i = 0; i < resources_num; i++)
{
status.Available[i] -= Request[i];
status.Allocation[process][i] += Request[i];
status.Need[process][i] -= Request[i];
if(status.Need[process][i] != 0)
process_end = 0;
}
printf("资源分配成功\n");
if(process_end)
{
printf("进程P%d执行完,释放资源\n",process);
for(int i = 0; i < resources_num; i++)
{
status.Available[i] += status.Allocation[process][i];
}
}
}
}
return 0;
}