Digital Library

An Implementation of a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs Based on the CSP Model and Java

RSS feed for this publication

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DISRTA.2002.1166900

Sixth IEEE International Workshop on ...

	This Article
	PURCHASE ARTICLE: $19 PDF HTML IEEE Xplore Subscribers
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/Endnote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by G. P. de Souza Articles by G. H. Pfitscher

	ASCII Text	x
	G. P. de Souza, G. H. Pfitscher, "An Implementation of a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs Based on the CSP Model and Java," Distributed Simulation and Real-Time Applications, IEEE International Symposium on, vol. 0, no. 0, pp. 0143, Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT'02), 2002.

	BibTex	x
	@article{ 10.1109/DISRTA.2002.1166900, author = {G. P. de Souza and G. H. Pfitscher}, title = {An Implementation of a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs Based on the CSP Model and Java}, journal ={Distributed Simulation and Real-Time Applications, IEEE International Symposium on}, volume = {0}, year = {2002}, isbn = {}, pages = {0143}, doi = {http://doi.ieeecomputersociety.org/10.1109/DISRTA.2002.1166900}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Distributed Simulation and Real-Time Applications, IEEE International Symposium on TI - An Implementation of a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs Based on the CSP Model and Java SN - SP EP A1 - G. P. de Souza, A1 - G. H. Pfitscher, PY - 2002 VL - 0 JA - Distributed Simulation and Real-Time Applications, IEEE International Symposium on ER -

G. P. de Souza

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 have proposed a distributed algorithm that solve the problem in a efficient away. 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 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.

Citation:

G. P. de Souza, G. H. Pfitscher, "An Implementation of a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs Based on the CSP Model and Java," ds-rt,pp.0143, Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications (DS-RT'02), 2002

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.

				Searching...	Advanced Search
	CS Search		Google Search