Cooperative Distributed Algorithms for Dynamic Cycle Prevention

Authors:
S. Katz;O. Shmueli
Affiliations:
-;-
Venue:
IEEE Transactions on Software Engineering
Year:
1987

Citing 0
Cited 6

A distributed deadlock detection algorithm for CSP-like communication

ACM Transactions on Programming Languages and Systems (TOPLAS)
A superimposition control construct for distributed systems

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Efficient Distributed Deadlock Avoidance Algorithm for the AND Model

IEEE Transactions on Software Engineering
Development of a Class of Distributed Termination Detection Algorithms

IEEE Transactions on Knowledge and Data Engineering
Bounded time-stamps

Distributed Computing
Bounded time-stamps

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

Parallel distributed algorithms are presented for adding and deleting edges in a directed graph without creating a cycle. Such algorithms are useful for a variety of problems in distributed systems such as preventing deadlock or ordering priorities. The algorithms operate in a realistic asynchronous computer network environment in which there are numerous possible interactions among overlapping instances of the algorithms.