Improving fast paxos: Being optimistic with no overhead

Proceedings - 12th Pacific Rim International Symposium on Dependable Computing, PRDC 2006

Volumn , Issue , 2006, Pages 287-295

  Charron Bost, Bernadette ^a   Schiper, André ^b  

^a ECOLE POLYTECHNIQUE   (France)

^b EPFL   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMMUNICATION SYSTEMS; COMPUTATION THEORY; PROBLEM SOLVING;

ORDINARY PAXOS; SINGLE CONSENSUS ALGORITHMS;

ALGORITHMS;

EID: 40349089998     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PRDC.2006.39     Document Type: Conference Paper

References (19)

1. M. Aguilera and S. Toueg. Failure detection and randomization: A hybrid approach to solve consensus. SIAM J. Cornput., 28(3):890-903, 1998.
2. R. Boichat, P. Dutta, S. Frolund, and R. Guerraoui. Reconstructing Paxos. ACM SIGACT News, 34(1):47-67, 2003.
3. F. Brasileiro, F. Greve, A. Mostéfaoui, and M. Raynal. Consensus in one communication step. In 6th International Conference Parallel Computing Technologies (PaCT), pages 42-50. Springer Verlag, LNCS 2127, 2001.
4. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of ACM, 43(2):225-267, 1996.
5. B. Charron-Bost and A. Schiper. The Heard-Of model: Unifying all benign failures. Technical report, EPFL, July 2006.
6. D. Dolev, C. Dwork, and L. Stockmeyer. On the minimal synchrony needed for distributed consensus. Journal of ACM, 34(1):77-97, January 1987.
7. C. Dwork, N. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. Journal of ACM, 35(2):288-323, April 1988.
8. M. Fischer, N. Lynch, and M. Paterson. Impossibility of Distributed Consensus with One Faulty Process. Journal of ACM, 32:374-382, April 1985.
9. Eli Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In Proc of the 17th ACM Symp. Principles of Distributed Computing (PODC), pages 143-152, Puerto Vallarta, Mexico, June-July 1998.
10. L. Lamport. The Part-Time Parliament. TR 49, Digital SRC, September 1989.
11. L. Lamport. The Part-Time Parliament. ACM Trans, on Computer Systems, 16(2):133-169, May 1998.
12. L. Lamport. Lower bounds for asynchronous consensus. Technical Report MSR-TR-2004-71, Microsoft, 2004.
13. L. Lamport. Fast Paxos. Technical Report MSR-TR-2005-12, Microsoft, 2005.
14. N. A. Lynch. Distributed Algorithms. Morgan Kaufmann, 1996.
15. F Pedone, A. Schiper, P. Urban, and D. Cavin. Solving Agreement Problems with Weak Ordering Oracles. In Proceedings of the 4th European Dependable Computing Conference (EDCC-4), LNCS-2485, pages 44-61, Toulouse, France, October 2002. Springer-Verlag.
16. M. Rabin. Randomized Byzantine Generals. In Proc. 24th Annual ACM Symposium on Foundations of Computer Science, pages 403-409, 1983.
17. N. Santoro and P. Widmayer. Time is not a healer. In Proceedings of the 6th Symposium on Theor. Aspects of Computer Science, pages 304-313, Paderborn, Germany, 1989.
18. A. Schiper. Early consensus in an asynchronous system with a weak failure detector. Distributed Computing, 10(3): 149-157, April 1997.
19. F. B. Schneider. Implementing Fault Tolerant Services Using the State Machine Approach: A Tutorial. Computing Surveys, 22(4):299-319, December 1990.