-
Notifications
You must be signed in to change notification settings - Fork 1
/
Banker.cpp
161 lines (141 loc) · 2.83 KB
/
Banker.cpp
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
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
#include<stdio.h>
#define process 3 //total number of process
#define resource 3 //total types of different resources
////Variables
int flagComplete[process]={0,3,0};//flag to check if the all the process has finished its tasks or not
int e[resource];//matrix to store total resource that the system has
int a[resource];//matrix to store total available or unused resource
int c[resource][process];//matrix to store data of each roesurce taken by each process
int r[resource][process];//matrix to store data of each resource that a process requires
////functions
void readMatrix();//read content of matrices e,c,r
void status();//displays contents of all matrices e,a,c,r
void getA();//generate available resources
int runableProcess();//returns the runable process number(-1 if no runable process is found)
void runProcess(int);//runs the given process and frees the resources used by the process so that it is available to run other processes
int main()
{
int result;
readMatrix();
getA();
for (int x=0;x<process;x++)
{
status();
result = runableProcess();
if(result==-1)
{
{
printf("\nNON OF THE PROCESS CAN RUN \n The process is Deadlock");
return 1;
}
}
else
{
printf("\n PROCESS %d CAN RUN",result);
runProcess(result);
flagComplete[result]=1;
}
}
printf("\nAll of the process has been processed");
status();
return 0;
}
void getA()
{
int temp[resource]={0,0,0};
for (int i=0 ; i<process;i++)
{for (int j=0;j<resource;j++)
temp[i]=temp[i]+c[j][i];
}
for (int i=0;i<resource;i++)
{
a[i]=e[i]-temp[i];
}
}
void status()
{
int i,j;
printf("\n \nE\n");
for (i=0;i<resource ;i++)
{
printf("%d, ",e[i]);
}
printf("\n R\n");
for (i=0;i<process ;i++)
{
for (j=0;j<resource;j++)
{
printf(" %d,",r[i][j]);
}
printf("\n");
}
printf("\n C\n");
for (i=0;i<process ;i++)
{
for (j=0;j<resource;j++)
{
printf(" %d ",c[i][j]);
}
printf("\n");
}
printf(" A\n");
for (i=0;i<resource ;i++)
{
printf("%d,",a[i]);
}
}
void readMatrix()
{
int i,j;
printf("enter E\n");
for (i=0;i<resource ;i++)
{
printf("e[%d]",i);
scanf("%d",&e[i]);
}
printf("\n enter R\n");
for (i=0;i<process ;i++)
{
printf("for process %d",i);
for (j=0;j<resource;j++)
{
scanf("%d",&r[i][j]);
}
}
printf("\n enter C\n");
for (i=0;i<process ;i++)
{
printf("for process %d",i);
for (j=0;j<resource;j++)
{
scanf("%d",&c[i][j]);
}
}
}
int runableProcess()
{
int possible;
for (int j=0;j<resource;j++)
{
possible=0;
for (int i=0;i<process;i++)
{
if (a[i]-r[j][i]>=0)
{
possible++;
}
}
if (possible==3 && flagComplete[j]==0)
return j;
}
return -1;
}
void runProcess(int x)
{
for(int i=0;i<resource;i++)
{
r[x][i]=0;
a[i]+=c[x][i];
c[x][i]=0;
}
}