首页> 外文会议>25th WoTUG Technical Meeting on Communicating Process Architectures 2002 Sep 15-18, 2002 University of Reading, United Kingdom >Implementing a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs
【24h】

Implementing a Distributed Algorithm for Detection of Local Knots and Cycles in Directed Graphs

机译:实现有向图中局部结点和循环检测的分布式算法

获取原文
获取原文并翻译 | 示例

摘要

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'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.
机译:通常,大多数死锁都采用循环(在数据库系统中)和打结(在通信系统中)的形式。 Boukerche和Tropper提出了一种分布式算法来检测通用图中的周期和结。他们的算法的消息复杂度为2m,而Chandy和Misra算法的消息复杂度为(至少)4m,其中m是图中的链接数,并且需要O(n log n)位内存,其中n是数节点。我们已经实现了Boukerche算法。我们对算法的实现基于CSP模型过程的构建。该实现是使用JCSP(Java的CSP实现)完成的。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号