Scribd
Upload
19 views5 pages

Lab 5

The document contains a C program that implements the Banker's Algorithm for deadlock avoidance in a system with a maximum of 5 processes and 3 resources. It prompts the user to input the allocation and maximum resource requirements of each process, calculates the need matrix, and determines a safe sequence if one exists. If a safe sequence cannot be found, it indicates that a safe sequence does not exist.

Uploaded by

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

Lab 5

The document contains a C program that implements the Banker's Algorithm for deadlock avoidance in a system with a maximum of 5 processes and 3 resources. It prompts the user to input the allocation and maximum resource requirements of each process, calculates the need matrix, and determines a safe sequence if one exists. If a safe sequence cannot be found, it indicates that a safe sequence does not exist.

Uploaded by

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

//Develop a C program to simulate Bankers Algorithm for DeadLock Avoidance.

#include<stdio.h>
int main() {
/* array will store at most 5 process with 3 resoures if your process or
resources is greater than 5 and 3 then increase the size of array */

int p, c, count = 0, i, j, alc[5][3], max[5][3], need[5][3], safe[5], available[3];


int done[5], terminate = 0;
printf("Enter the number of process and resources");
scanf("%d%d", &p, &c);

// p is process and c is diffrent resources


printf("enter allocation of resource of all process %dx%d matrix", p, c);
for (i = 0; i < p; i++)
{
for (j = 0; j < c; j++) {
scanf("%d", &alc[i][j]);
}
}
printf("enter the max resource process required %dx%d matrix", p, c);
for (i = 0; i < p; i++)
{
for (j = 0; j < c; j++)
{
scanf("%d", &max[i][j]);
}
}
printf("enter the available resource");
for (i = 0; i < c; i++)
scanf("%d", &available[i]);

printf("\n need resources matrix are\n");


for (i = 0; i < p; i++) {
for (j = 0; j < c; j++) {
need[i][j] = max[i][j] - alc[i][j];
printf("%d\t", need[i][j]);
}
printf("\n");
}
/* once process execute variable done will stop them for again execution */
for (i = 0; i < p; i++) {
done[i] = 0;
}
while (count < p) {
for (i = 0; i < p; i++) {
if (done[i] == 0) {
for (j = 0; j < c; j++) {
if (need[i][j] > available[j])
break;
}
//when need matrix is not greater then available matrix then if j==c will true
if (j == c) {
safe[count] = i;
done[i] = 1;
/* now process get execute release the resources and add them in available resources
*/
for (j = 0; j < c; j++) {
available[j] += alc[i][j];
}
count++;
terminate = 0;
}
else {
terminate++;
}
}
}

if (terminate == (p - 1)) {
printf("safe sequence does not exist");
break;
}

}
if (terminate != (p - 1)) {
printf("\n available resource after completion\n");
for (i = 0; i < c; i++) {
printf("%d\t", available[i]);
}
printf("\n safe sequence are\n");
for (i = 0; i < p; i++) {
printf("p%d\t", safe[i]);
}
}
return 0;
}

OUTPUT:
Enter the number of process and resources5 3
enter allocation of resource of all process 5x3 matrix
010
200
302
211
002
enter the max resource process required 5x3 matrix
753
322
902
322
222
enter the available resource3 3 2

need resources matrix are


7 4 3
1 2 2
6 0 0
1 1 1
2 2 0

available resource after completion


10 5 7
safe sequence are p1 p3 p4 p0 p2

Enter the number of process and resources5 3


enter allocation of resource of all process 5x3 matrix
010
200
302
211
002
enter the max resource process required 5x3 matrix
753
322
902
322
222
enter the available resource3 1 1
need resources matrix are
7 4 3
1 2 2
6 0 0
1 1 1
2 2 0
safe sequence does not exist

You might also like