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

Geraldo Pereira de Souza, 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","authors":"Geraldo Pereira de Souza, G. H. Pfitscher","doi":"10.1109/DISRTA.2002.1166900","DOIUrl":null,"url":null,"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.","PeriodicalId":375320,"journal":{"name":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","volume":"72 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. Sixth IEEE International Workshop on Distributed Simulation and Real-Time Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DISRTA.2002.1166900","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

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.
基于CSP模型和Java的有向图局部结点和环的分布式检测算法的实现
有向图中的循环和结是与数据库和通信系统中的死锁相关的问题。提出了许多检测有向图中的环和结的算法。Boukerche和Tropper(1998)提出了一种分布式算法,以高效的方式解决了这个问题。他们的算法的消息复杂度为2m,而Chandy和Misra算法的消息复杂度(至少)为4m,其中m是图中的链接数,并且需要O (n log n)位内存,其中n是节点数。根据CSP模型过程的构建,实现了Boukerche和Tropper算法。我们的实现是使用JCSP (Java的CSP实现)完成的,并给出了结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信