db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
%T Implementing a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
%A Geraldo Pereira de Souza, Gerson Henrique Pfitscher
db_connect: Could not connect to paper db at "wotug@dragon.kent.ac.uk"
%E James S. Pascoe, Roger J. Loader, Vaidy S. Sunderam
%B Communicating Process Architectures 2002
%X In general, most deadlocks take form of cycles (in database
systems) and knots (in communication systems). Boukerche and
Tropper have proposed a distributed algorithm to detect
cycles and knots in generic graphs. Their algorithm has a
message complexity of 2m vs. (at least) 4m for the Chandy
and Misra algorithm, where m is the number of links in the
graph, and requires O (n log n) bits of memory, where n is
the number of nodes. We have implemented Boukerche\[rs]s
algorithm. Our implementation of the algorithm is based on
the construction of processes of the CSP model. The
implementation was done using JCSP, an implementation of CSP
for Java.