High throughput total order broadcast for cluster environments

Proceedings of the International Conference on Dependable Systems and Networks

Volumn 2006, Issue , 2006, Pages 549-557

  Guerraoui, Rachid ^a,b   Levy, Ron R ^a   Pochon, Bastian ^a   Quema, Vivien ^c,d  

^a EPFL   (Switzerland)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^c INRIA   (France)

^d SAPIENZA UNIVERSITY OF ROME   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CARRIER COMMUNICATION; COMMUNICATION; COMPUTER SOFTWARE; DATA TRANSFER; LOCAL AREA NETWORKS; NETWORK PROTOCOLS; TELECOMMUNICATION SERVICES;

BROADCAST PROTOCOLS; ETHERNET; MESSAGES;

BROADCASTING;

EID: 33845598234     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DSN.2006.37     Document Type: Conference Paper

References (41)

1. Y. Amir, L. E. Moser, P. M. Melliar-Smith, D. A. Agarwal, and P. Ciarfella. The Totem single-ring ordering and membership protocol. ACM Transactions on Computer Systems, 13(4):311-342, 1995.
2. E. Anceaume. A lightweight solution to uniform atomic broadcast for asynchronous systems. In Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS 97), Washington, DC, USA, 1997. IEEE Computer Society.
3. S. Armstrong, A. Freier, and K. Marzullo. Multicast transport protocol. RFC 1301, IETF, 1992.
4. R. Baldoni, S. Cimmino, and C. Marchetti. A Classification of Total Order Specifications and its Application to Fixed Sequencer-based Implementations, to appear in Journal of Parallel and Distributed Computing, June 2006.
5. A. Bar-Noy and S. Kipnis. Designing broadcasting algorithms in the postal model for message-passing systems. Mathematical Systems Theory, 27(5):431-452, 1994.
6. K. Birman and T. Joseph. Exploiting virtual synchrony in distributed systems. In Proceedings of the eleventh ACM Symposium on Operating systems principles (SOSP 87), pages 123-138, New York, NY, USA, 1987. ACM Press.
7. K. Birman and T. Joseph. Reliable communication in the presence of failures. ACM Trans. Comput. Syst., 5(1):47-76, 1987.
8. K. Birman and R. van Renesse. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, 1993.
9. R. Carr. The tandem global update protocol. Tandem Syst. Rev. 1, pages 74-85, jun 1985.
10. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. J. ACM, 43(2):225-267, 1996.
11. T. Chandra and S. Toueg. Unreliable failure detectors for reliable distributed systems. Journal of the ACM, 43(2):225-267, 1996.
12. J.-M. Chang and N. Maxemchuk. Reliable broadcast protocols. ACM Trans. Comput. Syst., 2(3):251-273, 1984.
13. F. Cristian. Asynchronous atomic broadcast. IBM Technical Disclosure Bulletin, 33(9): 115-116, 1991.
14. F. Cristian, S. Mishra, and G. Alvarez. High-performance asynchronous atomic broadcast. Distrib. Syst. Eng. J., 4(2):109-128, jun 1997.
15. D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subramonian, and T. von Eicken. LogP: Towards a realistic model of parallel computation. In Principles Practice of Parallel Programming, pages 1-12, 1993.
16. X. Defago, A. Schiper, and P. Urban. Comparative performance analysis of ordering strategies in atomic broadcast algorithms. IEICE Trans, on Information and Systems, E86-D(12):2698-2709, 2003.
17. X. Defago, A. Schiper, and P. Urban. Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv., 36(4):372-421, 2004.
18. R. Ekwall, A. Schiper, and P. Urban. Token-based atomic broadcast using unreliable failure detectors. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems (SRDS 04), pages 52-65, Washington, DC, USA, 2004. IEEE Computer Society.
19. P. Ezhilchelvan, R. Macedo, and S. Shrivastava. Newtop: a fault-tolerant group communication protocol. In Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS 95), Washington, DC, USA, 1995. IEEE Computer Society.
20. T. Friedman and R. V. Renesse. Packing messages as a tool for boosting the performance of total ordering protocls. In Proceedings of the 6th International Symposium on High Performance Distributed Computing (HPDC 97), Washington, DC, USA, 1997. IEEE Computer Society.
21. U. Fritzke, P. Ingels, A. Mostefaoui, and M. Raynal. Consensus-based fault-tolerant total order multicast. IEEE Trans. Parallel Distrib. Syst., 12(2):147-156, 2001.
22. H. Garcia-Molina and A. Spauster. Ordered and reliable multicast communication. ACM Trans. Compul. Syst., 9(3):242 271, 1991.
23. A. Gopal and S. Toueg. Reliable broadcast in synchronous and asynchronous environments (preliminary version). In Proceedings of the 3rd International Workshop on Distributed Algorithms, pages 110-123, London, UK, 1989. Springer-Verlag.
24. R. Guerraoui and A. Schiper. Software-based replication for fault tolerance. Computer, 30(4):68-74, 1997.
25. V. Hadzilacos and S. Toueg. Fault-tolerant broadcasts and related problems. Distributed systems (2nd Ed.), pages 97-145, 1993.
26. F. Kaashoek and A. Tanenbaum. An evaluation of the amoeba group communication system. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS 96), Washington, DC, USA, 1996. IEEE Computer Society.
27. J. Kim and C. Kim. A total ordering protocol using a dynamic token-passing scheme. Distrib. Syst. Eng. J., 4(2):87-95, jun 1997.
28. M. Leclercq, V. Quema, and J.-B. Stefani. DREAM: a Component Framework for the Construction of Resource-Aware, Configurable MOMs. IEEE Distributed Systems Online, 6(9), September 2005.
29. S. Luan and V. Gligor. A fault-tolerant protocol for atomic broadcast. IEEE Trans. Parallel Distrib. Syst., 1(3):271 285, 1990.
30. N. A. Lynch. Distributed Algorithms. Morgan-Kaufmann, 1996.
31. L. Malhis, W. Sanders, and R. Schlichting. Numerical performability evaluation of a group multicast protocol. Distrib. Syst. Eng. J., 3(1):39-52, march 1996.
32. L. Moser, P. Melliar-Smith, and V. Agrawala. Asynchronous fault-tolerant total ordering algorithms. SIAM J. Comput., 22(4):727-750, 1993.
33. Netperf. http://www.netperf.org/.
34. T. Ng. Ordered broadcasts for large applications. In Proceedings of the 10th IEEE International Symposium on Reliable Distributed Systems (SRDS 91), pages 188-197, Pisa, Italy, 1991. IEEE Computer Society.
35. L. Peterson, N. Buchholz, and R. Schlichting. Preserving and using context information in interprocess communication. ACM Trans. Comput. Syst., 7(3):217-246, 1989.
36. L. Rodrigues, H. Fonseca, and P. Verissimo. Totally ordered multicast in large-scale systems. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS 96), Washington, DC, USA, 1996. IEEE Computer Society.
37. Sun. Java 2 Platform, Enterprise Edition (J2EE). http://java.sun.com/ j2ee/.
38. P. Urban, X. Defago, and A. Schiper. Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms. In Proceedings of 9th IEEE International Conference on Computer Communications and Networks (IC3N 2000), pages 582-589, 2000.
39. P. Vicente and L. Rodrigues. An indulgent uniform total order algorithm with optimistic delivery. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS 02), Washington, DC, USA, 2002. IEEE Computer Society.
40. B. Whetten, T. Montgomery, and S. Kaplan. A high performance totally ordered multicast protocol. In Selected Papers from the International Workshop on Theory and Practice in Distributed Systems, pages 33-57, London, UK, 1994. Springer-Verlag.
41. U. Wilhelm and A. Schiper. A hierarchy of totally ordered multicasts. In Proceedings of the 14TH Symposium on Reliable Distributed Systems, Washington, DC, USA, 1995. IEEE Computer Society.