Consensus-Based Management of Distributed and Replicated Data

Atomic Broadcast andAtomic Commitment are fundamental problems that have to be solved when managin g distributed/replicated data. This short note aims at showing t hat solutions to these problems can benefit from results associated with theConsensus problem. Such an approach helps gain a better insight into di stributed/replicated data management problems. More precisely, this note addresses one of the most importan t issues one is faced to when designing distributed/replica ted data management protocols, namely, their Non-Blocking property. This property stipulates that the crash of nodes participating in a protocol must not prevent the non-crashe d nodes from terminating the protocol execution. Results from the Consensus study allow to know the minimal assumptions a system must satisfy in order its distributed/replicated data management protocols be non-blo cking despite process crash and asynchrony.

[1]  Achour Mostéfaoui,et al.  Fault-tolerant Total Order Multicast to asynchronous groups , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[2]  Rachid Guerraoui,et al.  Exploiting Atomic Broadcast in Replicated Databases , 1998, Euro-Par.

[3]  Andreas Reuter,et al.  Transaction Processing: Concepts and Techniques , 1992 .

[4]  Rachid Guerraoui,et al.  The Decentralized Non-Blocking Atomic Commitment Protocol , 1995, Proceedings.Seventh IEEE Symposium on Parallel and Distributed Processing.

[5]  Bernadette Charron-Bost,et al.  Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes , 1996, WDAG.

[6]  Ozalp Babaoglu,et al.  Non-blocking atomic commitment , 1993 .

[7]  Roy Friedman,et al.  Failure detectors in omission failure environments , 1997, PODC '97.

[8]  Divyakant Agrawal,et al.  Using broadcast primitives in replicated databases , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[9]  Rachid Guerraoui,et al.  Atomic Updates of Replicated Data , 1996, EDCC.

[10]  Marcos K. Aguilera,et al.  Failure detection and consensus in the crash-recovery model , 2000, Distributed Computing.

[11]  Gustavo Alonso,et al.  A suite of database replication protocols based on group communication primitives , 1998, Proceedings. 18th International Conference on Distributed Computing Systems (Cat. No.98CB36183).

[12]  Michel Raynal,et al.  Atomic broadcast in asynchronous crash-recovery distributed systems , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[13]  Rachid Guerraoui.  Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus , 1995, WDAG.

[14]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1992, PODC '92.

[15]  Sam Toueg,et al.  The weakest failure detector for solving consensus , 1996, JACM.

[16]  André Schiper.  Early consensus in an asynchronous system with a weak failure detector , 1997, Distributed Computing.

[17]  Sam Toueg,et al.  Unreliable failure detectors for reliable distributed systems , 1996, JACM.

[18]  Michel Raynal,et al.  Probabilistic analysis of a group failure detection protocol , 1999, 1999 Proceedings. Fourth International Workshop on Object-Oriented Real-Time Dependable Systems.

[19]  André Schiper,et al.  Stubborn Communication Channels , 1998 .

[20]  Achour Mostéfaoui,et al.  Consensus in asynchronous systems where processes can crash and recover , 1998, Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems (Cat. No.98CB36281).

[21]  André Schiper,et al.  From group communication to transactions in distributed systems , 1996, CACM.

[22]  MICHEL HURFIN,et al.  FAST ASYNCHRONOUS CONSENSUS BASED ON A WEAK FAILURE DETECTOR , 1997 .

[23]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.

[24]  Kenneth P. Birman,et al.  Reliable communication in the presence of failures , 1987, TOCS.