Distributed discrete-event simulation
ACM Computing Surveys (CSUR)
A distributed scheme for detecting communication deadlocks
IEEE Transactions on Software Engineering
A survey of distributed deadlock detection algorithms
ACM SIGMOD Record
Pseudosimulation: an algorithm for distributed similation with limited memory
International Journal of Parallel Programming
Deadlock detection in distributed databases
ACM Computing Surveys (CSUR)
An Efficient Distributed Knot Detection Algorithm
IEEE Transactions on Software Engineering
Parallel simulation of communicating finite state machines
PADS '93 Proceedings of the seventh workshop on Parallel and distributed simulation
Distributed deadlock detection algorithm
ACM Transactions on Database Systems (TODS)
A Distributed Graph Algorithm: Knot Detection
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed deadlock detection
ACM Transactions on Computer Systems (TOCS)
Efficient Detection and Resolution of Generalized Distributed Deadlocks
IEEE Transactions on Software Engineering
A distributed algorithm for deadlock detection and resolution
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
Distributed detection of generalized deadlocks
ICDCS '97 Proceedings of the 17th International Conference on Distributed Computing Systems (ICDCS '97)
Performance Analysis of Distributed Deadlock Detection Algorithms
IEEE Transactions on Knowledge and Data Engineering
A Fast Algorithm for Detecting Distributed Deadlocks in the OR Request Model
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Efficient Generalized Deadlock Detection and Resolution in Distributed Systems
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Lightweight time synchronization for sensor networks
WSNA '03 Proceedings of the 2nd ACM international conference on Wireless sensor networks and applications
Fast, Centralized Detection and Resolution of Distributed Deadlocks in the Generalized Model
IEEE Transactions on Software Engineering
Stochastic analysis of distributed deadlock scheduling
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
On Optimal Deadlock Detection Scheduling
IEEE Transactions on Computers
Efficient detection and resolution of OR deadlocks in distributed systems
Journal of Parallel and Distributed Computing
Efficient detection of a locally stable predicate in a distributed system
Journal of Parallel and Distributed Computing
A concurrent distributed deadlock detection/resolution algorithm for distributed systems
ISTASC'05 Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation
Static Analysis of Concurrent Programs Using Ordinary Differential Equations
ICTAC '09 Proceedings of the 6th International Colloquium on Theoretical Aspects of Computing
Fast detection and resolution of generalized distributed deadlocks
EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing
Distributed and Parallel Databases
| Hi-index | 0.00 |
In this paper, a distributed cycle/knot detection algorithm for general graphs is presented. The algorithm distinguishes between cycles and knots and is the first algorithm to our knowledge which does so. It is especially relevant to an application such as parallel simulation in which 1) cycles and knots can arise frequently, 2) the size of the graph is very large, and 3) it is necessary to know if a given node is in a cycle or a knot. It requires less communication than previous algorithms驴2m vs. (at least) (4m) for the Chandy and Misra algorithm, where m is the number of links in the graph. It requires O (nlog (n)) bits of memory, where n is the number of nodes. The algorithm differs from the classical diffusing computation methods through its use of incomplete search messages to speed up the computation. We introduce a marking scheme in order to identify strongly connected subcomponents of the graph which cannot reach the initiator of the algorithm. This allows us to distinguish between the case in which the initiator is in a cycle (only) or is in a knot.