Scribd
Upload
14 views4 pages

Os 8

The document provides a C program that implements a deadlock detection algorithm for processes and resources. It prompts the user to input the number of processes, resources, allocation matrix, maximum matrix, and available resources, then calculates the need matrix and checks for deadlocks. The output indicates whether a deadlock is detected or if all processes can finish successfully.

Uploaded by

jayaprakash9223
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
14 views4 pages

Os 8

The document provides a C program that implements a deadlock detection algorithm for processes and resources. It prompts the user to input the number of processes, resources, allocation matrix, maximum matrix, and available resources, then calculates the need matrix and checks for deadlocks. The output indicates whether a deadlock is detected or if all processes can finish successfully.

Uploaded by

jayaprakash9223
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/ 4

Sprno:9223

8 IMPLEMENT DEADLOCK DETECTION ALGORITHM


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

int main()
{
int n, m, i, j, count = 0;

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


scanf("%d", &n);

printf("Enter total number of resources: ");


scanf("%d", &m);

int allocation[n][m], maximum[n][m], available[m], need[n][m];


int finished[n];

printf("Enter Allocation Matrix (allocated resources for each process):\n");


for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
scanf("%d", &allocation[i][j]);

printf("Enter Maximum Matrix (maximum resources required by each


process):\n");
for (i = 0; i < n; i++)
for (j = 0; j < m; j++)
scanf("%d", &maximum[i][j]);

printf("Enter Available Resources:\n");


for (i = 0; i < m; i++)
Sprno:9223

scanf("%d", &available[i]);

// Calculate need matrix


for (i = 0; i < n; i++)
{
for (j = 0; j < m; j++)
{
need[i][j] = maximum[i][j] - allocation[i][j];
}
}

// Initialize all processes as unfinished


for (i = 0; i < n; i++)
finished[i] = 0;

// Deadlock detection loop


bool progress;
do {
progress = false;
for (i = 0; i < n; i++)
{
if (!finished[i])
{
bool can_finish = true;
for (j = 0; j < m; j++)
{
if (need[i][j] > available[j])
{
can_finish = false;
break;
Sprno:9223

}
}
if (can_finish)
{
for (j = 0; j < m; j++)
{
available[j] += allocation[i][j];
}
finished[i] = 1;
progress = true;
count++;
}
}
}
} while (progress);

if (count == n)
{
printf("No deadlock detected, all processes can finish.\n");
}
else
{
printf("Deadlock detected among processes:\n");
for (i = 0; i < n; i++)
{
if (!finished[i])
printf("Process P%d\n", i);
}
}
Sprno:9223

return 0;
}
OUTPUT:
Enter total number of processes: 4
Enter total number of resources: 3
Enter Allocation Matrix (allocated resources for each process):
010
200
303
211
Enter Maximum Matrix (maximum resources required by each process):
753
322
903
422
Enter Available Resources:
332
No deadlock detected, all processes can finish.

You might also like