-
Notifications
You must be signed in to change notification settings - Fork 0
/
bankers.c
146 lines (87 loc) · 1.47 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
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
#include <stdio.h>
int allocation[20][20], max[20][20], avl[20], need[20][20];
int r,p;
void safecheck()
{
int work[20], finish[20] = {0}, i, j, flag = 0, u;
int counter = 0;
for(i=0;i<r;i++)
work[i] = avl[i];
while(1)
{
flag = 0;
for(j=0;j<r;j++)
{
if(need[counter][j] <= work[j])
{
flag = 1;
break;
}
}
if(flag == 0)
{
for(j=0;j<r;j++)
work[j] += allocation[counter][j];
finish[counter] = 1;
printf("Hello\n");
printf("%d\n", counter);
}
counter++;
if(counter >= p)
counter = 0;
for(i=0;i<p;i++)
{
if(finish[i] == 0)
{
break;
}
}
if(i == p)
{
printf("There exists a safe state\n");
break;
}
}
for(i=0; i<p; i++)
printf("%d\t", finish[i]);
}
int main()
{
int i,j,k;
printf("Enter the total no. of processes:\n");
scanf("%d", &p);
printf("Enter the total no. of resources:\n");
scanf("%d", &r);
printf("Enter the allocation matrix:\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
scanf("%d", &allocation[i][j]);
}
}
printf("Enter the max matrix:\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
scanf("%d", &max[i][j]);
need[i][j] = max[i][j] - allocation[i][j];
}
}
printf("The need matrix is:\n");
for(i=0;i<p;i++)
{
for(j=0;j<r;j++)
{
printf("%d ", need[i][j]);
}
printf("\n");
}
printf("Enter avaliable:\n");
for(i=0;i<r;i++)
scanf("%d", &avl[i]);
safecheck();
printf("\n");
return 0;
}