预防进程死锁的银行家算法c语言代码

银行家算法是一种用于避免进程死锁的算法，它通过预测系统资源的可用性来避免进程在竞争资源时发生死锁。以下是该算法的C语言实现代码：

#include <stdio.h>
#define MAX 100

int main()
{
    int n, m, i, j, k;
    int available[MAX], max[MAX][MAX], allocation[MAX][MAX], need[MAX][MAX];
    int request[MAX], p, safeSequence[MAX], finish[MAX], count = 0;

    printf("Enter the number of processes: ");
    scanf("%d", &n);

    printf("Enter the number of resources: ");
    scanf("%d", &m);

    printf("Enter the number of available resources: ");
    for (i = 0; i < m; i++)
    {
        scanf("%d", &available[i]);
    }

    printf("Enter the maximum resource allocation matrix:\n");
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < m; j++)
        {
            scanf("%d", &max[i][j]);
        }
    }

    printf("Enter the resource allocation matrix:\n");
    for (i = 0; i < n; i++)
    {
        for (j = 0; j < m; j++)
        {
            scanf("%d", &allocation[i][j]);
            need[i][j] = max[i][j] - allocation[i][j];
        }
    }

    printf("Enter the process number that is requesting resources: ");
    scanf("%d", &p);

    printf("Enter the resource request vector: ");
    for (i = 0; i < m; i++)
    {
        scanf("%d", &request[i]);
    }

    for (i = 0; i < m; i++)
    {
        if (request[i] > need[p][i])
        {
            printf("Error: The process has exceeded its maximum claim\n");
            return 0;
        }
        if (request[i] > available[i])
        {
            printf("Error: The process must wait\n");
            return 0;
        }
    }

    for (i = 0; i < m; i++)
    {
        available[i] -= request[i];
        allocation[p][i] += request[i];
        need[p][i] -= request[i];
    }

    for (i = 0; i < n; i++)
    {
        finish[i] = 0;
    }

    for (k = 0; k < n; k++)
    {
        for (i = 0; i < n; i++)
        {
            if (finish[i] == 0)
            {
                for (j = 0; j < m; j++)
                {
                    if (need[i][j] > available[j])
                        break;
                }
                if (j == m)
                {
                    for (j = 0; j < m; j++)
                    {
                        available[j] += allocation[i][j];
                    }
                    safeSequence[count++] = i;
                    finish[i] = 1;
                }
            }
        }
    }

    printf("The safe sequence is: ");
    for (i = 0; i < n - 1; i++)
    {
        printf("P%d -> ", safeSequence[i]);
    }
    printf("P%d\n", safeSequence[n - 1]);

    return 0;
}