操作系统原理C语言实现银行家算法

以下是C语言实现银行家算法的示例代码：

#include <stdio.h>
#include <stdbool.h>

#define MAX_PROCESS 10
#define MAX_RESOURCE 10

int available[MAX_RESOURCE];
int max[MAX_PROCESS][MAX_RESOURCE];
int allocation[MAX_PROCESS][MAX_RESOURCE];
int need[MAX_PROCESS][MAX_RESOURCE];
bool finish[MAX_PROCESS];

int num_process, num_resource;

void init() {
    printf("请输入进程数和资源数：\n");
    scanf("%d%d", &num_process, &num_resource);

    printf("请输入每个资源的可用数量：\n");
    for (int i = 0; i < num_resource; i++) {
        scanf("%d", &available[i]);
    }

    printf("请输入每个进程所需的最大资源数：\n");
    for (int i = 0; i < num_process; i++) {
        for (int j = 0; j < num_resource; j++) {
            scanf("%d", &max[i][j]);
        }
    }

    printf("请输入每个进程已分配的资源数：\n");
    for (int i = 0; i < num_process; i++) {
        for (int j = 0; j < num_resource; j++) {
            scanf("%d", &allocation[i][j]);
            need[i][j] = max[i][j] - allocation[i][j];
        }
    }
}

bool check(int process) {
    for (int i = 0; i < num_resource; i++) {
        if (need[process][i] > available[i]) {
            return false;
        }
    }
    return true;
}

void banker() {
    int count = 0;
    while (count < num_process) {
        bool flag = false;
        for (int i = 0; i < num_process; i++) {
            if (!finish[i] && check(i)) {
                for (int j = 0; j < num_resource; j++) {
                    available[j] += allocation[i][j];
                }
                finish[i] = true;
                flag = true;
                count++;
                printf("进程%d执行完毕\n", i);
            }
        }
        if (!flag) {
            printf("无法分配资源，系统不安全\n");
            return;
        }
    }
    printf("系统安全\n");
}

int main() {
    init();
    banker();
    return 0;
}