Download:
|
by Michel Hurfin, Michel Raynal, Eric Tronel, Projet Adp
In Proc. of the IEEE Int. Performance, Computing, and Communications Conference
ftp://ftp.irisa.fr/techreports/1997/PI-1147.ps.gz
Add To MetaCart
Abstract:
Publication interne n1147--- Novembre 1997--- 15 pages Abstract: Providing processes with the same view of a global state or allowing them to take consistent decisions, despite asynchrony and failure occurrences, are fundamental problems encountered in distributed systems. These problems are called agreement problems. Non-blocking atomic commitment and definition of a single delivery order for broadcast messages are examples of such problems. In this paper, we define a paradigm (called Single Global View) that encompasses various practical agreement problems. The interest of this paradigm lies in its practicability: each process starts with an initial value, and all these values are pieced together in such a way that, despite process crashes and asynchrony, all correct processes are delivered the same set of values (namely, the Single Global View). The power of this paradigm is the same as the one of the consensus problem defined by theoreticians. Instantiations of the paradigm, which solve practical agreement problems, are given. A protocol implementing the paradigm is also presented.
Citations
|
1349
|
Concurrency control and recovery in database systems. Addison-Wesley series in computer science
– BERNSTEIN, HADZILACOS, et al.
- 1987
|
|
1099
|
Impos-sibility of distributed consensus with one faulty processor
– Fischer, Lynch, et al.
- 1985
|
|
838
|
The Byzantine generals problem
– Lamport, Shostak, et al.
- 1982
|
|
829
|
Distributed snapshots: Determining global states of distributed systems
– Chandy, Lamport
- 1985
|
|
695
|
Unreliable Failure Detectors for Reliable Distributed Systems
– Chandra, Toueg
- 1996
|
|
320
|
Consensus in the presence of partial synchrony
– Dwork, Lynch, et al.
- 1988
|
|
315
|
The weakest failure detector for solving consensus
– Chandra, Hadzilacos, et al.
- 1992
|
|
214
|
Atomic broadcast: From simple message diffusion to byzantine agreement
– Cristian, Aghali, et al.
- 1985
|
|
211
|
On the minimal synchronism needed for distributed consensus
– Dolev, Dwork, et al.
- 1987
|
|
66
|
Using time instead of timeout in fault-tolerant systems
– Lamport
- 1984
|
|
54
|
Notes on Database Operating Systems', in Operating Systems: An Advanced
– Gray
- 1979
|
|
53
|
Consensus Service: A Modular Approach for Building Fault-Tolerant Agreement Protocols in Distributed Systems
– Guerraoui, Schiper
- 1996
|
|
42
|
S.: Simulating reliable links with unreliable links in the presence of process crashes
– Basu, Charron-Bost, et al.
- 1996
|
|
42
|
Fail-awareness in timed asynchronous systems
– Fetzer, Cristian
- 1996
|
|
35
|
Reliable Broadcast and Related Problems
– Hadzilacos, Toueg
- 1993
|
|
5
|
General protocols for consensus in distributed systems
– Yahata, Takizawa
- 1995
|
|
3
|
Real-time dependable decisions in timed asynchronous distributed systems
– RAYNAL
- 1997
|
|
2
|
A Solution to Atomic Commitment Based on an Extended Consensus Protocol
– Hurfin, Tronel
- 1997
|
