Scribd
Upload
11 views

Program-5 OS 2022 Scheme

The document describes a C program to simulate Banker's Algorithm for deadlock avoidance. The program takes input for the number of processes and resources, allocation and maximum matrices, and available resources. It calculates the need matrix and initializes available resources and finish arrays. It then checks if the system is in a safe state by verifying resources needs can be met by available resources, and updates resources and finish arrays accordingly. The program outputs whether the system is in a safe state or not.

Uploaded by

satyakarthikryali
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Program-5 OS 2022 Scheme

The document describes a C program to simulate Banker's Algorithm for deadlock avoidance. The program takes input for the number of processes and resources, allocation and maximum matrices, and available resources. It calculates the need matrix and initializes available resources and finish arrays. It then checks if the system is in a safe state by verifying resources needs can be met by available resources, and updates resources and finish arrays accordingly. The program outputs whether the system is in a safe state or not.

Uploaded by

satyakarthikryali
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Program 5.

Develop a C program to simulate Bankers Algorithm for DeadLock


Avoidance.

#include <stdio.h>
#define MAX_PROCESS 10
#define MAX_RESOURCE 10
int main() {
int n, m, i, j, k;
int allocation[MAX_PROCESS][MAX_RESOURCE],
max[MAX_PROCESS][MAX_RESOURCE], available[MAX_RESOURCE];
int need[MAX_PROCESS][MAX_RESOURCE], finish[MAX_PROCESS],
safeSeq[MAX_PROCESS], work[MAX_RESOURCE];

printf("Enter the number of processes: ");


scanf("%d", &n);
printf("Enter the number of resources: ");
scanf("%d", &m);
printf("Enter the allocation matrix:\n");
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) {
scanf("%d", &allocation[i][j]);
}
}
printf("Enter the maximum matrix:\n");
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) {
scanf("%d", &max[i][j]);
}
}
printf("Enter the available resources:\n");
for (i = 0; i < m; ++i) {
scanf("%d", &available[i]);
}
// Initialize finish array
for (i = 0; i < n; ++i) {
finish[i] = 0;
}
// Calculate need matrix
for (i = 0; i < n; ++i) {
for (j = 0; j < m; ++j) {
need[i][j] = max[i][j] - allocation[i][j];
}
}
// Initialize work array with available resources
for (i = 0; i < m; ++i) {
work[i] = available[i];
}
int count = 0;
while (count < n) {
int found = 0;
for (i = 0; i < n; ++i) {
if (finish[i] == 0) {
int flag = 1;
for (j = 0; j < m; ++j) {
if (need[i][j] > work[j]) {
flag = 0;
break;
}
}
if (flag) {
for (k = 0; k < m; ++k) {
work[k] += allocation[i][k];
}
safeSeq[count++] = i;
finish[i] = 1;
found = 1;
}
}
}
if (!found) {
printf("System is not in a safe state!\n");
return 0;
}
}
printf("System is in a safe state.\n ");
return 0;
}

Output:

You might also like