Consensus-Based Management of Distributed and Replicated Data.

@article{DBLP:journals/debu/Raynal98,
  author    = {Michel Raynal},
  title     = {Consensus-Based Management of Distributed and Replicated Data},
  journal   = {IEEE Data Eng. Bull.},
  volume    = {21},
  number    = {4},
  year      = {1998},
  pages     = {30-37},
  ee        = {db/journals/debu/Raynal98.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Atomic Broadcase and Atomic Commitment are fundamental problems that have to be solved when managing distributed/replicated data. This short note aims at showing that solutions to these problems can benefit from results associated with the Consensus problem. Such an approach helps gain a better insight into distributed/replicated data management problems.

More precisely, this note addresses one of the most important issues one is faced to when designing distributed/replicated 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-crashed nodes from terminating the protocol execution. Results from the Consensus study allow to know the minimal assuptions a system must satisfy in oredr its distributed/replicated data management protocols to be non-blocking despite process crash and asynchrony.

Copyright © 1998 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/smod7592 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Online Edition:

References

[1]

Divyakant Agrawal, Gustavo Alonso, Amr El Abbadi, Ioana Stanoi: Exploiting Atomic Broadcast in Replicated Databases (Extended Abstract). Euro-Par 1997: 496-503 BibTeX

[2]

...

[3]

...

[4]

Anindya Basu, Bernadette Charron-Bost, Sam Toueg: Simulating Reliable Links with Unreliable Links in the Presence of Process Crashes. WDAG 1996: 105-122 BibTeX

[5]

Philip A. Bernstein, Vassos Hadzilacos, Nathan Goodman: Concurrency Control and Recovery in Database Systems. Addison-Wesley 1987, ISBN 0-201-10715-5
Contents BibTeX

[6]

...

[7]

Tushar Deepak Chandra, Sam Toueg: Unreliable Failure Detectors for Reliable Distributed Systems. J. ACM 43(2): 225-267(1996) BibTeX

[8]

Tushar Deepak Chandra, Vassos Hadzilacos, Sam Toueg: The Weakest Failure Detector for Solving Consensus. J. ACM 43(4): 685-722(1996) BibTeX

[9]

Danny Dolev, Roy Friedman, Idit Keidar, Dahlia Malkhi: Failure Detectors in Omission Failure Environments. PODC 1997: 286 BibTeX

[10]

Michael J. Fischer, Nancy A. Lynch, Mike Paterson: Impossibility of Distributed Consensus with One Faulty Process. J. ACM 32(2): 374-382(1985) BibTeX

[11]

...

[12]

Jim Gray, Andreas Reuter: Transaction Processing: Concepts and Techniques. Morgan Kaufmann 1993, ISBN 1-55860-190-2
Contents BibTeX

[13]

Rachid Guerraoui: Revistiting the Relationship Between Non-Blocking Atomic Commitment and Consensus. WDAG 1995: 87-100 BibTeX

[14]

...

[15]

...

[16]

...

[17]

...

[18]

...

[19]

...

[20]

...

[21]

...

[22]

Fernando Pedone, Rachid Guerraoui, André Schiper: Exploiting Atomic Broadcast in Replicated Databases. Euro-Par 1998: 513-520 BibTeX

[23]

...

[24]

...

[25]

André Schiper: Early Consensus in an Asynchronous System with a Weak Failure Detector. Distributed Computing 10(3): 149-157(1997) BibTeX

[26]

André Schiper, Michel Raynal: From Group Communication to Transactions in Distributed Systems. Commun. ACM 39(4): 84-87(1996) BibTeX

[27]

Dale Skeen: Nonblocking Commit Protocols. SIGMOD Conference 1981: 133-142 BibTeX

[28]

...

[29]

...