Proceedings Article10.1145/62546.62556
Understanding and verifying distributed algorithms using stratified decomposition
Ching-Tsun Chou,Eli Gafni +1 more
- 01 Jan 1988
- pp 44-65
62
TL;DR: This paper provides firm theoretical ground for temporal ordering in describing the behavior of algorithms-statements like “after A, task B is performed” in the absence of an explicit termination detection for A built into the algorithm.
read more
Abstract: Designers of autonomous distributed algorithms ( i.e., algorithms whose complete input is available before the start of execution) customarily refer to temporal ordering in describing the behavior of their algorithms-statements like “after A, task B is performed.” In the absence of an explicit termination detection for A built into the algorithm such a statement should be puzzling. However, the available proof methodologies do not seem to hinge on such statements. This paper provides firm theoretical ground for such as*Supported by NSF Presidential Young Investigators Award under grant DCR84-51396 and matching funds from IBM Faculty Development Award under grant D840622. Permission to copy without fee all or part of this material is granted provided that the copies are not made or distributed for direct commercial advantage, the ACM copyright notice and the title of the publication and its date appear, and notice is given that copying is by permission of the Association for Computing Machinery. To copy otherwise, or to republish, requires a fee and/ or specific permission.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Round-by-Round Fault Detectors: Unifying Synchrony and Asynchrony”
Eli Gafni
- 01 Jan 1998
TL;DR: In this article, the authors present a new family of models of distributed-computation which combines features from synchronous, asynchronous, and failure-detector-augmented systems.
148
Distributed programming with tasks
Eli Gafni,Sergio Rajsbaum +1 more
- 14 Dec 2010
TL;DR: A new simulation from the snapshots model to the IS model is presented, and it is shown that the simulation can work with models that have access to certain communication objects, called 01-tasks, and that it can be extended to work with Models stronger that wait-free.
62
Recursion in distributed computing
Eli Gafni,Sergio Rajsbaum +1 more
- 20 Sep 2010
TL;DR: This work presents several distributed algorithms in a recursive form, which makes them easier to understand and analyze and exposes several interesting issues arising in recursive distributed algorithms.
48
From sequential layers to distributed processes: deriving a distributed minimum weight spanning tree algorithm
Wil Janssen,Job Zwiers +1 more
- 01 Oct 1992
TL;DR: A framework is introduced that allows for a formal treatment of the design process, from an abstract initial design to an implementation tailored to specific architectures, by deriving an implementation of a distributed minimum weight spanning tree algorithm in the style of [GHS].
Iterated shared memory models
Sergio Rajsbaum
- 19 Apr 2010
TL;DR: This talk surveys results in the iterated model with more powerful base tasks or enriched with failure detectors, which have been useful to prove impossibility results and to design algorithms, due to the elegant recursive structure of the runs.
35
References
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this article, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Time, clocks, and the ordering of events in a distributed system
TL;DR: In this paper, the concept of one event happening before another in a distributed system is examined, and a distributed algorithm is given for synchronizing a system of logical clocks which can be used to totally order the events.
Distributed snapshots: determining global states of distributed systems
K. Mani Chandy,Leslie Lamport +1 more
TL;DR: An algorithm by which a process in a distributed system determines a global state of the system during a computation, which helps to solve an important class of problems: stable property detection.
A Distributed Algorithm for Minimum-Weight Spanning Trees
TL;DR: A distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights that can be initiated spontaneously at any node or at any subset of nodes.
A Distributed Algorithm for Minimum Weight Spanning Trees. Revision
Robert G. Gallager,Pierre A. Humblet,P. M. Spira +2 more
- 01 Oct 1979
TL;DR: In this paper, a distributed algorithm is presented that constructs the minimum weight spanning tree in a connected undirected graph with distinct edge weights, where a processor exists at each node of the graph, knowing initially only the weights of the adjacent edges.
1K