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

Author

De Souza, Geraldo Pereira ; Pfitscher, Gerson Henrique

Author_Institution

Dept. of Comput. Sci., Univ. of Brasilia, Brazil

fYear

2002

fDate

2002

Firstpage

143

Lastpage

150

Abstract

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.

Keywords

Java; communicating sequential processes; communication complexity; digital simulation; directed graphs; distributed algorithms; parallel programming; CSP model; JCSP; Java; communication systems; database systems; deadlocks; directed graphs; distributed algorithm; links; local cycle detection; local knot detection; memory bits; message complexity; nodes; Algorithm design and analysis; Communication systems; Computer aided software engineering; Database systems; Distributed algorithms; Fault tolerant systems; Frequency; IP networks; Java; System recovery;

fLanguage

English

Publisher

ieee

Conference_Titel

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

ISSN

1530-1990

Print_ISBN

0-7695-1853-2

Type

conf

DOI

10.1109/DISRTA.2002.1166900

Filename

1166900