-
Notifications
You must be signed in to change notification settings - Fork 0
/
bankers.c
71 lines (70 loc) · 2.01 KB
/
bankers.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
#include <stdio.h>
void main() {
int n,r,need[10][10],alloc[10][10],max[10][10],avail[10];
printf("Enter the number of processes -- ");
scanf("%d", &n);
printf("Enter the number of resources -- ");
scanf("%d", &r);
printf("Enter the allocation matrix -- \n");
for(int i = 0; i < n; i++) {
for(int j = 0; j < r; j++) {
scanf("%d", &alloc[i][j]);
}
}
printf("Enter the max matrix -- \n");
for(int i = 0; i < n; i++) {
for(int j = 0; j < r; j++) {
scanf("%d", &max[i][j]);
}
}
printf("Enter the available resources -- ");
for(int i = 0; i < r; i++) {
scanf("%d", &avail[i]);
}
//need matrix
for(int i = 0; i < n; i++) {
for(int j = 0; j < r; j++) {
need[i][j] = max[i][j] - alloc[i][j];
}
}
int finish[10],ans[10],ind=0;
for(int i = 0; i < n; i++) {
finish[i] = 0;
}
int flag,j;
//deadlock detection
for(int i = 0; i < n; i++) {
flag = 0;
if(finish[i] == 0) { //process is not finished
for(j = 0; j < r; j++) { // check if need is less than available
if(need[i][j] > avail[j]) {
flag=1;
break;
}
}
if(flag == 0) { //need is less than available so complete process
finish[i] = 1;
ans[ind++] = i;
for(int k = 0; k < r; k++) { //adding alloc to available
avail[k] += alloc[i][k];
}
i = -1;
}
}
}
flag = 0; //check if the system is in deadlock
for(int i = 0; i < n; i++) {
if(finish[i] == 0) {
printf("The system is in deadlock\n");
flag = 1;
break;
}
}
if(flag == 0) {
printf("The system is in safe state\n");
printf("Safe sequence is -- ");
for(int i = 0; i < n; i++) {
printf("P%d ", ans[i]);
}
}
}