Book Chapter10.1007/BFB0022141
Dissecting Distributed Coordination
Aleta Ricciardi
- 13 Sep 1995
- pp 101-115
6
TL;DR: There is an essential structure of information flow in any solution to Uniform Coordination, suggesting message-minimal solutions, and the notion of exempting processes from coordinating is introduced.
read more
Abstract: This paper derives necessary and sufficient communication for distributed applications that perform certain actions uniformly in asynchronous systems. We show there is an essential structure of information flow in any solution to Uniform Coordination, suggesting message-minimal solutions. We show it is necessary for processes to conspire against each other to make progress, and we show this conspiracy requires processes to stop communicating with each other. This, we show, renders Uniform Coordination insensitive to channel delivery guarantees. We introduce the notion of exempting processes from coordinating. We show that ‘primary partition’ behavior (Isis) arises from the desire to make exempt an process indistinguishable from a crashed process. Defining weaker exemptions for distributed coordination problems gives rise to many problems solvable in asynchronous systems as well as in systems that partition.
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
A new look at membership services (extended abstract)
Gil Neiger
- 01 May 1996
TL;DR: A New Look at Membership Services* as mentioned in this paper proposes a new look at membership services, which is based on the concept of membership service membership service, and proposes a membership service model.
49
Impossibility of (repeated) reliable broadcast
Aleta Ricciardi
- 01 May 1996
TL;DR: In the absence of perfect failure detectors, and of processes that never crash, this work illuminates the need for a more exible notion of "non-faulty process", and for a thorough investigation of coordination problems in which the set of participating processes is dynamic.
11
Dissecting Distributed Coordination
Aleta Ricciardi
- 13 Sep 1995
TL;DR: There is an essential structure of information flow in any solution to Uniform Coordination, suggesting message-minimal solutions, and the notion of exempting processes from coordinating is introduced.
6
The Sage project: a new approach to software engineering for distributed applications
A. Ricciardi
- 27 May 1997
TL;DR: The Sage project, a new approach to software engineering for (fault-tolerant) distributed applications that uses the modal logic of knowledge and theoretical results detailing how processes learn facts about each other's state to derive the minimal communication graph, is described.
2
Algorithms for building fault-tolerant distributed systems
James Roger Mitchell,Vijay K. Garg +1 more
- 01 Jan 1997
TL;DR: This dissertation presents methods of predicate detection, recovery, and optimistic execution which help achieve the goal of lower latency for distributed applications without the need for active process replication.
1
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.
The Byzantine Generals Problem
TL;DR: The Albanian Generals Problem as mentioned in this paper is a generalization of Dijkstra's dining philosophers problem, where two generals have to come to a common agreement on whether to attack or retreat, but can communicate only by sending messengers who might never arrive.
The Byzantine generals problem
TL;DR: In this article, a group of generals of the Byzantine army camped with their troops around an enemy city are shown to agree upon a common battle plan using only oral messages, if and only if more than two-thirds of the generals are loyal; so a single traitor can confound two loyal generals.
Impossibility of distributed consensus with one faulty process
TL;DR: In this paper, it is shown that every protocol for this problem has the possibility of nontermination, even with only one faulty process.
4.7K
Related Papers (5)
Susanne Graf,Doron Peled,Sophie Quinton +2 more
- 01 Apr 2012
Michel Raynal,Michel Raynal +1 more
- 06 Apr 2014
Shimon Cohen,Daniel Lehmann +1 more
- 18 Aug 1982