Scribd
Upload
30 views3 pages

C Program That Implements The Banker

The document contains a C program that implements the Banker's Algorithm for deadlock avoidance, utilizing concepts such as allocated resources, maximum demand, available resources, and remaining needs. It checks if the system is in a safe state and prints a safe sequence if possible. The output indicates that the system is in a safe state with a specific safe sequence of processes.

Uploaded by

halaplay385
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
30 views3 pages

C Program That Implements The Banker

The document contains a C program that implements the Banker's Algorithm for deadlock avoidance, utilizing concepts such as allocated resources, maximum demand, available resources, and remaining needs. It checks if the system is in a safe state and prints a safe sequence if possible. The output indicates that the system is in a safe state with a specific safe sequence of processes.

Uploaded by

halaplay385
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

C program that implements the Banker's Algorithm for deadlock avoidance:

Key Concepts:
 alloc: Currently allocated resources.
 max: Maximum demand of each process.
 avail: Available resources.
 need = max - alloc: Resources still needed.
 Checks if system is in a safe state and prints a safe sequence if possible.

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

#define P 5 // Number of processes


#define R 3 // Number of resources

int main() {
int alloc[P][R] = { {0, 1, 0}, {2, 0, 0}, {3, 0, 2}, {2, 1, 1}, {0, 0, 2} };
int max[P][R] = { {7, 5, 3}, {3, 2, 2}, {9, 0, 2}, {2, 2, 2}, {4, 3, 3} };
int avail[R] = {3, 3, 2};

int need[P][R];
for (int i = 0; i < P; i++)
for (int j = 0; j < R; j++)
need[i][j] = max[i][j] - alloc[i][j];

bool finish[P] = {0};


int safeSeq[P];
int work[R];
for (int i = 0; i < R; i++)
work[i] = avail[i];

int count = 0;
while (count < P) {
bool found = false;
for (int p = 0; p < P; p++) {
if (!finish[p]) {
bool canAllocate = true;
for (int j = 0; j < R; j++) {
if (need[p][j] > work[j]) {
canAllocate = false;
break;
}
}
if (canAllocate) {
for (int k = 0; k < R; k++)
work[k] += alloc[p][k];

safeSeq[count++] = p;
finish[p] = true;
found = true;
}
}
}
if (!found) {
printf("System is not in a safe state.\n");
return -1;
}
}

printf("System is in a safe state.\nSafe sequence: ");


for (int i = 0; i < P; i++)
printf("P%d ", safeSeq[i]);
printf("\n");

return 0;
}

Output

System is in a safe state.


Safe sequence: P1 P3 P4 P0 P2

You might also like