操作系统实验--进程调度--银行家算法 C++实现

#include <iostream>
#include<string>
using namespace std;
//n is the number of process, m is the number of resource
int n = 5, m = 4;
int k = 0;
//用于记住用户输入的进程顺序
int rember[20];
int re = 0;
class Banker {
public:
	Banker(int n, int m);
	void Order(int rember[], int v);
	int Select_P();
	int Check(int k);
	int Recycle(int k);
	int Distribute(int **Need, int k);
	int Check_All();
private:
	// 存储二维数组的地址
	int **M, **N, **A;
	int availuble[20];
	// 定义一个数组，用于输入进程的各种资源数量
	string Name_M[20];
};
// 在构造函数中对进程中所需的资源进行初始化
Banker::Banker(int n, int m)
{
	int **Max = new int*[n];
	int **Need = new int*[n];
	int **Allocation = new int*[n];
	cout << "请输入进程n的数量:" << endl;
	cin >> n;
	cout << "请输入资源数m的数量:" << endl;
	cin >> m;
	cout << "请输入这" << n << "个进程的名字:" << endl;
	//初始化进程的名字
	for (int i = 0;i < n;i++)
		cin >> Name_M[i];
	//初始化进程分配之后的资源剩余量
	cout << "请输入availuble的值：" << endl;
	for (int i = 0; i < m; i++)
		cin >> availuble[i];
	//动态生成二维数组
	for (int i = 0;i < n;i++)
		Max[i] = new int[m];
	M = Max;



	//对Max矩阵进行初始化
	for (int i = 0;i < n;i++)
	{
		cout << "进程" << Name_M[i] << "的Max的值：" << endl;
		for (int j = 0;j < m;j++)
			cin >> Max[i][j];
	}

	for (int i = 0;i < n;i++)
		Need[i] = new int[m];
	N = Need;

	//对Need矩阵进行初始化
	for (int i = 0;i < n;i++)
	{
		cout << "进程" << Name_M[i] << "的Need的值：" << endl;
		for (int j = 0;j < m;j++)
			cin >> Need[i][j];
	}

	for (int i = 0;i < n;i++)
		Allocation[i] = new int[m];
	A = Allocation;

	//初始化Allocation矩阵
	for (int i = 0;i < n;i++)
	{
		cout << "进程" << Name_M[i] << "的Allocation的值：" << endl;
		for (int j = 0;j < m;j++)
			cin >> Allocation[i][j];
	}
}

int Banker::Select_P()
{
	string s;
	cout << "请输入你选择的进程的名称：" << endl;
	cin >> s;
	for (int i = 0; i < n; i++)
		if (s == Name_M[i])
		{
			k = i;
			break;
		}
		else
		{
			if (k == n)
			{
				cout << "进程输入错误，请重新输入：" << endl;
				Select_P();
			}
			else
				continue;
		}
	return k;
}

int Banker::Check(int k)
{
	for (int i = 0; i < m; i++)
	{
		if (N[k][i] == 0)
		{
			continue;
		}

		else
		{
			cout << Name_M[k] << "进程的Need不全为0，开始调用Distribute函数。" << endl;
		}
		//该进程的Need全为0，调用回收资源函数，结束该进程，
		Recycle(k);
		Check_All();
		return 0;
	}
}
int Banker::Distribute(int **Ne_ed, int k)
//int Banker::Distribute(int Ne_ed[5][4], int k)
{
	for (int i = 0; i < m; i++)
	{
		if (Ne_ed[k][i] <= availuble[i])
		{
			if (i < m - 1)
				continue;
			else
			{
				cout << "已经为" << Name_M[k] << "分配资源" << endl;
				cout << "availuable现有资源数为：" << endl;
				for (int i = 0; i < m; i++)
				{
					availuble[i] = availuble[i] - Ne_ed[k][i];
					cout << availuble[i] << " ";
				}
				cout << endl;
				// 当系统对进程资源进行分配的时候，将被分配的进程记录下来
				rember[re] = k;
				re = re + 1;
				return 0;
			}
		}
		else
		{
			cout << "资源不足，进程无法全部执行，请选择一个新的进程：" << endl;
			break;
		}
	}
	return -1;
}
int  Banker::Recycle(int k)
{

	int y = Distribute(N, k);
	if (y == 0)
	{
		cout << "进程" << Name_M[k] << "结束，之后availuble的值为：" << endl;
		for (int i = 0; i < n; i++)
		{
			//availuble[i] = availuble[i] + N[k][i];
			availuble[i] = availuble[i] + M[k][i];
			cout << availuble[i] << " ";
		}
		for (int j = 0; j < m; j++)
			//将该进程的Need全置为零
			N[k][j] = 0;
		cout << endl;
	}
	else
		return -1;
	return 0;
}
int Banker::Check_All()
{
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < m; j++)
		{
			//if (Ne_ed[i][j] == 0)
			if (N[i][j] == 0)
				continue;
			else
			{
				cout << "还有进程未结束，继续执行！" << endl;
				break;
			}
		}

		if (i = n - 1)
		{
			k = Select_P();
			Check(k);
		}
		else
			break;
	}
	return 0;
}
void Banker::Order(int rember[], int v)
{
	cout << "进程的执行顺序为：";
	for (int i = 0; i < v; i++)
		cout << Name_M[i] << " ";
}
int main()
{
	Banker bank(n, m);
	bank.Select_P();
	bank.Check(k);
	bank.Order(rember, n);
	return 0;
}