By Topic

An implementation of a distributed algorithm for detection of local knots and cycles in directed graphs based on the CSP model and Java

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
G. P. de Souza ; Dept. of Comput. Sci., Univ. of Brasilia, Brazil ; G. H. Pfitscher

Cycles and knots in directed graphs are problems that can be associated with deadlocks in database and communication systems. Many algorithms to detect cycles and knots in directed graphs were proposed. Boukerche and Tropper (1998) have proposed a distributed algorithm that solves the problem in a efficient away. Their algorithm has a message complexity of 2 m vs. (at least) 4 m 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 and Tropper's algorithm according to the construction of processes of the CSP model. Our implementation was done using JCSP, an implementation of CSP for Java, and the results are presented.

Published in:

Distributed Simulation and Real-Time Applications, 2002. Proceedings. Sixth IEEE International Workshop on

Date of Conference: