Timeliness, failure-detectors, and consensus performance

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 2006, Issue , 2006, Pages 169-178

  Keidar, Idit ^a   Shraer, Alexander ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Eventual synchrony; Failure detectors; Indulgent consensus; Lower bounds

Indexed keywords

ALGORITHMS; COMPUTER SYSTEM RECOVERY; DETECTORS; PROBLEM SOLVING;

EVENTUAL SYNCHRONY; FAILURE DETECTORS; INDULGENT CONSENSUS; LOWER BOUNDS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748685002     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1146381.1146408     Document Type: Conference Paper

References (35)

1. M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Stable leader election. In DISC, pages 108-122, 2001.
2. M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. On implementing omega with weak reliability and synchrony assumptions. In PODC, pages 306-314, 2003.
3. M. K. Aguilera, C. Delporte-Gallet, H. Fauconnier, and S. Toueg. Communication-efficient leader election and consensus with limited link synchrony. In PODC, pages 328-337, 2004.
4. O. Bakr. Performance evaluation of distributed algorithms over the Internet. Master's thesis, MIT, Feb. 03.
5. O. Bakr and I. Keidar. Evaluating the running time of a communication round over the Internet. In PODC, pages 243-252, 2002.
6. F. Brasileiro, F. Greve, A. Mostefaoui, and M. Raynal. Consensus in one communication step. In 6th Intl. Conference on Parallel Computing Technology, pages 42-50, Sept. 2001.
7. N. Cardwell, S. Savage, and T. Anderson. Modeling the performance of short tcp connections, 1998.
8. T. D. Chandra, V. Hadzilacos, and S. Toueg. The weakest failure detector for solving consensus. J. ACM, 43(4):685-722, July 1996.
9. T. D. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225-267, 1996.
10. B. Charron-Bost and A. Schiper. Uniform consensus is harder than consensus. J. Algorithms, 51(1):15-37, 2004.
11. F. Cristian and C. Fetzer. The timed asynchronous distributed system model. In IEEE TPDS, pages 642-657, June 1999.
12. P. Dutha, R. Guerraoui, and I. Keidar. The overhead of consensus failure recovery. Technical Report 200456, École Polytechnique Fédérale de Lausanne, 2004.
13. P. Dutha, R. Guerraoui, and I. Keidar. The overhead of consensus failure recovery. Submitted for publication, 2005.
14. P. Dutta and R. Guerraoui. Fast indulgent consensus with zero degradation. In EDCC, Oct. 2002.
15. P. Dutta and R. Guerraoui. The inherent price of indulgence. In PODC, July 2002.
16. P. Dutta, R. Guerraoui, and L. Lamport. How fast can eventual synchrony lead to consensus?. In DSN, pages 22-27, 2005.
17. P. Dutta, R. Guerraoui, and B. Pochon. Tight lower bounds on early local decisions in uniform consensus. In DISC, pages 264-278, Oct 2003.
18. C. Dwork, N. A. Lynch, and L. Stockmeyer. Consensus in the presence of partial synchrony. J. ACM, 35(2):288-323, Apr. 1988.
19. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. J. ACM, 32(2):374-382, Apr. 1985.
20. E. Gafni. Round-by-round fault detectors: Unifying synchrony and asynchrony. In PODC, pages 143-152, 1998.
21. R. Guerraoui. Indulgent algorithms. In 19th ACM Symp. on Principles of Distributed Computing (PODC-19), pages 289-298, July 2000.
22. R. Guerraoui and M. Raynal. The information structure of indulgent consensus. IEEE Transactions on Computers, 53(4):453-466, 2004.
23. R. Guerraoui and A. Schiper. "ΓT-accurate" failure detectors. In WDAG, pages 269-286, 1996.
24. I. Keidar and S. Rajsbaum. On the cost of fault-tolerant consensus when there are no faults - a tutorial. Technical Report MIT-LCS-TR-821, MIT, May 2001.
25. I. Keidar and A. Shraer. How to choose a timing model? Technical Report CCIT 586, Department of Electrical Engineering, Technion, May 2006.
26. I. Keidar and A. Shraer. Timeliness, failure-detectors, and consensus performance. Technical Report CCIT 576, Department of Electrical Engineering, Technion, Feb. 2006.
27. L. Lamport. The part-time parliament. ACM Trans. Comput. Syst., 16(2): 133-169, May 1998.
28. N. Lynch and M. Tuttle. An introduction to Input/Output Automata. CWI Quarterly, 2(3):219-246, 1989.
29. D. Malkhi, F. Oprea, and L. Zhou. Omega meets paxos: Leader election and stability without eventual timely links. DISC, pages 199-213, sep 2005.
30. J.-P. Martin and L. Alvisi. Fast byzantine consensus. In DSN, pages 402-411, 2005.
31. A. Mostefaoui and M. Raynal. Solving consensus using Chandra-Toueg's unreliable failure detectors: A general quorum-based approach. In 13th Intl. Symp. on Distributed Computing, pages 49-63, Sept. 1999.
32. N. Santoro and P. Widmayer. Time is not a healer. 6th Annual Symp. Theor. Aspects of Computer Science, volume 349 of LNCS:304-313, feb 1989.
33. U. Schmid and C. Fetzer. Randomized asynchronous consensus with imperfect communications. SRDS, 00:361, 2003.
34. U. Schmid and B. Weiss. Impossibility results and lower bounds for consensus under link failures. Technical Report 183/1-129, Technische Universita"t Wien, Dept. of Automation, Apr. 2002.
35. J. L. Welch and H. Attiya. Distributed computing: fundamentals, simulations and advanced topics. McGraw-Hill, Inc., Hightstown, NJ, USA, 1998.