<s>
The	O
Chandy	B-Algorithm
–	I-Algorithm
Misra	I-Algorithm
–	I-Algorithm
Haas	I-Algorithm
algorithm	I-Algorithm
resource	I-Algorithm
model	I-Algorithm
checks	O
for	O
deadlock	B-Operating_System
in	O
a	O
distributed	B-Architecture
system	I-Architecture
.	O
</s>
<s>
It	O
specifies	O
a	O
message	O
started	O
by	O
process	O
Pi	O
to	O
find	O
whether	O
a	O
deadlock	B-Operating_System
has	O
occurred	O
or	O
not	O
.	O
</s>
<s>
If	O
so	O
,	O
a	O
deadlock	B-Operating_System
occurs	O
.	O
</s>
<s>
If	O
both	O
are	O
equal	O
,	O
a	O
deadlock	B-Operating_System
occurs	O
,	O
otherwise	O
it	O
sends	O
the	O
probe	O
to	O
next	O
dependent	O
process	O
.	O
</s>
<s>
In	O
pseudocode	B-Language
,	O
the	O
algorithm	O
works	O
as	O
follows	O
:	O
</s>
<s>
thumb|occurrence	O
of	O
deadlock	B-Operating_System
in	O
distributed	O
systemP1	O
initiates	O
deadlock	B-Operating_System
detection	O
.	O
</s>
<s>
Therefore	O
,	O
deadlock	B-Operating_System
can	O
be	O
declared	O
.	O
</s>
<s>
Consider	O
that	O
there	O
are	O
"	O
m	O
"	O
controllers	O
and	O
"	O
p	O
"	O
process	O
to	O
perform	O
,	O
to	O
declare	O
whether	O
a	O
deadlock	B-Operating_System
has	O
occurred	O
or	O
not	O
,	O
the	O
worst	O
case	O
for	O
controllers	O
and	O
processes	O
must	O
be	O
visited	O
.	O
</s>
