Throughput optimal total order broadcast for cluster environments

ACM Transactions on Computer Systems

Volumn 28, Issue 2, 2010, Pages

  Guerraoui, Rachid ^a   Levy, Ron R ^a   Pochon, Bastian ^a   Quéma, Vivien ^b  

^a EPFL   (Switzerland)

^b CNRS   (France)

Author keywords

Cluster computing; Replication; Software fault tolerance; Total order broadcast

Indexed keywords

CLUSTER ENVIRONMENTS; COMMUNICATION PRIMITIVES; EQUAL OPPORTUNITY; GROUP COMMUNICATIONS; HIGH AVAILABILITY; INTERPROCESS COMMUNICATION; RING TOPOLOGY; SOFTWARE FAULT TOLERANCES; SOFTWARE FAULT-TOLERANCE; SOFTWARE-BASED; TOTAL ORDER BROADCAST;

COMPUTER SOFTWARE; FADING (RADIO); FAULT TOLERANCE; OPTIMIZATION; QUALITY ASSURANCE; THROUGHPUT;

CLUSTER COMPUTING;

EID: 77955189448     PISSN: 07342071     EISSN: 15577333     Source Type: Journal    
DOI: 10.1145/1813654.1813656     Document Type: Article

References (47)

1. AMIR, Y., DANILOV, C., MISKIN-AMIR, M., SCHULTZ, J., AND STANTON, J. 2004. The spread toolkit: Architecture and performance. Tech. rep., CNDS-2004-1, Johns Hopkins Univ.
2. AMIR, Y., MOSER, L.E., MELLIAR-SMITH, P.M., AGARWAL, D.A., AND CIARFELLA, P. 1995. The Totem single-ring ordering and membership protocol. ACM Trans. Comput. Syst. 13, 4, 311-342.
3. ANCEAUME, E. 1997. A lightweight solution to uniform atomic broadcast for asynchronous systems. In Proceedings of the 27th International Symposium on Fault-Tolerant Computing (FTCS'97). IEEE Computer Society Press, Los Alamitos, CA.
4. ARMSTRONG, S., FREIER, A., AND MARZULLO, K. 1992. Multicast transport protocol. RFC 1301, IETF.
5. BALDONI, R., CIMMINO, S., AND MARCHETTI, C. 2006. A classification of total order specifications and its application to fixed sequencer-based implementations. J. Parall. Distrib. Comput. 66, 1 (Jan.), 108-127.
6. BAN, B. 2007. JGroups-A Toolkit for Reliable Multicast Communication. http://www.jgroups.org.
7. BAR-NOY, A. AND KIPNIS, S. 1994. Designing broadcasting algorithms in the postal model for message-passing systems. Math. Syst. Theory 27, 5, 431-452.
8. BAR-NOY, A. AND KIPNIS, S. 1997. Multiple message broadcasting in the postal model. Networks 29, 1, 1-10.
9. BIRMAN, K. AND JOSEPH, T. 1987a. Exploiting virtual synchrony in distributed systems. In Proceedings of the 11th ACM Symposium on Operating Systems Principles (SOSP'87). ACM, New York, 123-138.
10. BIRMAN, K. AND JOSEPH, T. 1987b. Reliable communication in the presence of failures. ACM Trans. Comput. Syst. 5, 1, 47-76.
11. BIRMAN, K. AND VAN RENESSE, R. 1993. Reliable Distributed Computing with the Isis Toolkit. IEEE Computer Society Press, Los Alamitos, CA.
12. CARR, R. 1985. The tandem global update protocol. Tandem Syst. Rev. 1, 74-85.
13. CECCHET, E., MARGUERITE, J., AND ZWAENEPOEL, W. 2004. C-JDBC: Flexible database clustering middleware. In USENIX Conferenec. USENIX Association, Berkeley, CA.
14. CHANDRA, T. AND TOUEG, S. 1996. Unreliable failure detectors for reliable distributed systems. J. ACM 43, 2, 225-267.
15. CHANG, J.-M. AND MAXEMCHUK, N. 1984. Reliable broadcast protocols. ACM Trans. Comput. Syst. 2, 3, 251-273.
16. CRISTIAN, F. 1991. Asynchronous atomic broadcast. IBM Tech. Discl. Bull. 33, 9, 115-116.
17. CRISTIAN, F., MISHRA, S., AND ALVAREZ, G. 1997. High-performance asynchronous atomic broadcast. Distrib. Syst. Eng. J. 4, 2 (Jun), 109-128.
18. CULLER, D., KARP, R., PATTERSON, D., SAHAY, A., SCHAUSER, K., SANTOS, E., SUBRAMONIAN, R., AND VON EICKEN, T. 1993. LogP: Towards a realistic model of parallel computation. In Principles Practice of Parallel Programming. 1-12.
19. DÉFAGO, X., SCHIPER, A., AND URBÁN, P. 2003. Comparative performance analysis of ordering strategies in atomic broadcast algorithms. IEICE Trans. Inf. Syst. E86-D, 12, 2698-2709.
20. DÉFAGO, X., SCHIPER, A., AND URBÁN, P. 2004. Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv. 36, 4, 372-421.
21. DUNAGAN, J., HARVEY, N.J.A., JONES, M.B., KOSTIC, D., THEIMER, M., AND WOLMAN, A. 2004. FUSE: Lightweight guaranteed distributed failure notification. In Proceedings of the 6th Symposium on Operating Systems Design and Implementation (OSDI'04). USENIX Association, 151-166.
22. EKWALL, R., SCHIPER, A., AND URBAN, P. 2004. Token-based atomic broadcast using unreliable failure detectors. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems (SRDS'04). IEEE Computer Society Press, Los Alamitos, CA, 52-65.
23. EZHILCHELVAN, P., MACEDO, R., AND SHRIVASTAVA, S. 1995. Newtop: a fault-tolerant group communication protocol. In Proceedings of the 15th International Conference on Distributed Computing Systems (ICDCS'95). IEEE Computer Society Press, Los Alamitos, CA.
24. FRIEDMAN, T. AND RENESSE, R. V. 1997. Packing messages as a tool for boosting the performance of total ordering protocls. In Proceedings of the 6th IEEE International Symposium on High Performance Distributed Computing (HPDC'97). IEEE Computer Society Press, Los Alamitos, CA, 233.
25. FRITZKE, U., INGELS, P., MOSTEFAOUI, A., AND RAYNAL, M. 2001. Consensus-based fault-tolerant total order multicast. IEEE Trans. Parall. Distrib. Syst. 12, 2, 147-156.
26. GARCIA-MOLINA, H. AND SPAUSTER, A. 1991. Ordered and reliable multicast communication. ACM Trans. Comput. Syst. 9, 3, 242-271.
27. GOPAL, A. AND TOUEG, S. 1989. Reliable broadcast in synchronous and asynchronous environments (preliminary version). In Proceedings of the 3rd International Workshop on Distributed Algorithms. Springer-Verlag, Berlin, 110-123.
28. GUERRAOUI, R., KOSTIC, D., LEVY, R.R., AND QUÉMA, V. 2007. A high throughput atomic storage algorithm. In Proceedings of the 27th IEEE International Conference on Distributed Computing Systems (ICDCS'07). IEEE Computer Society Press, Los Alamitos, CA.
29. GUERRAOUI, R., LEVY, R.R., POCHON, B., AND QUEMA, V. 2006. High throughput total order broadcast for cluster environments. In Proceedings of the IEEE International Conference on Dependable Systems and Networks (DSN'06). IEEE Computer Society Press, Los Alamitos, CA.
30. HADZILACOS, V. AND TOUEG, S. 1993. Fault-tolerant broadcasts and related problems. In Distributed Systems. ACM, New York, 97-145.
31. JONES, R. 2007. Netperf. http://www.netperf.org/.
32. KAASHOEK, F. AND TANENBAUM, A. 1996. An evaluation of the amoeba group communication system. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS'96). IEEE Computer Society Press, Los Alamitos, CA.
33. KIM, J. AND KIM, C. 1997. A total ordering protocol using a dynamic token-passing scheme. Distrib. Syst. Eng. J. 4, 2, 87-95.
34. LUAN, S. AND GLIGOR, V. 1990. A fault-tolerant protocol for atomic broadcast. IEEE Trans. Parall. Distrib. Syst. 1, 3, 271-285.
35. LYNCH, N. A. 1996. Distributed Algorithms. Morgan-Kaufmann, San Francisco, CA.
36. MALHIS, L., SANDERS, W., AND SCHLICHTING, R. 1996. Numerical performability evaluation of a group multicast protocol. Distrib. Syst. Enj. J. 3, 1, 39-52.
37. MOSER, L., MELLIAR-SMITH, P., AND AGRAWALA, V. 1993. Asynchronous fault-tolerant total ordering algorithms. SIAM J. Comput. 22, 4, 727-750.
38. NG, T. 1991. Ordered broadcasts for large applications. In Proceedings of the 10th IEEE International Symposium on Reliable Distributed Systems (SRDS'91). IEEE Computer Society Press, Los Alamitos, CA, 188-197.
39. PETERSON, L., BUCHHOLZ, N., AND SCHLICHTING, R. 1989. Preserving and using context information in interprocess communication. ACM Trans. Comput. Syst. 7, 3, 217-246.
40. RODRIGUES, L., FONSECA, H., AND VERSSIMO, P. 1996. Totally ordered multicast in large-scale systems. In Proceedings of the 16th International Conference on Distributed Computing Systems (ICDCS96). IEEE Computer Society Press, Los Alamitos, CA.
41. SCHNEIDER, F. B. 1990. Implementing fault-tolerant services using the state machine approach: A tutorial. ACM Comput. Surv. 22, 4, 299-319.
42. STANTON, J. R. 2002. A Users Guide to Spread. http://www.spread.org/docs/ guide/users-guide.pdf.
43. URBÁN, P., DFAGO, X., AND SCHIPER, A. 2000. Contention-aware metrics for distributed algorithms: Comparison of atomic broadcast algorithms. In Proceedings of the 9th IEEE International Conference on Computer Communications and Networks (IC3N2000). IEEE Computer Society Press, Los Alamitos, CA, 582-589.
44. VAN RENESSE, R. AND SCHNEIDER, F. B. 2004. Chain replication for supporting high throughput and availability. In Proceedings of the 6th Symposium on Operating Systems Design & Implementation (OSDI'04). USENIX Association, Berkeley, CA.
45. VICENTE, P. AND RODRIGUES, L. 2002. An indulgent uniform total order algorithm with optimistic delivery. In Proceedings of the 21st IEEE Symposium on Reliable Distributed Systems (SRDS'02). IEEE Computer Society Press, Los Alamitos, CA.
46. WHETTEN, B., MONTGOMERY, T., AND KAPLAN, S. 1994. A high performance totally ordered multicast protocol. In Selected Papers from the International Workshop on Theory and Practice in Distributed Systems. Springer-Verlag, Berlin, 33-57.
47. WILHELM, U. AND SCHIPER, A. 1995. A hierarchy of totally ordered multicasts. In Proceedings of the 14th Symposium on Reliable Distributed Systems (SRDS'95). IEEE Computer Society Press, Los Alamitos, CA.