This Article 
 Bibliographic References 
 Add to: 
Using Optimistic Atomic Broadcast in Transaction Processing Systems
July/August 2003 (vol. 15 no. 4)
pp. 1018-1032

Abstract—Atomic broadcast primitives are often proposed as a mechanism to allow fault-tolerant cooperation between sites in a distributed system. Unfortunately, the delay incurred before a message can be delivered makes it difficult to implement high performance, scalable applications on top of atomic broadcast primitives. Recently, a new approach has been proposed for atomic broadcast which, based on optimistic assumptions about the communication system, reduces the average delay for message delivery to the application. In this paper, we develop this idea further and show how applications can take even more advantage of the optimistic assumption by overlapping the coordination phase of the atomic broadcast algorithm with the processing of delivered messages. In particular, we present a replicated database architecture that employs the new atomic broadcast primitive in such a way that communication and transaction processing are fully overlapped, providing high performance without relaxing transaction correctness.

[1] G. Alonso, Partial Database Replication and Group Communication Primitives (extended abstract) Proc. European Research Seminar on Advances in Distributed Systems, Jan. 1997.
[2] Y. Amir and C. Tutu, From Total Order to Database Replication Proc. Int'l Conf. Distributed Computing Systems, 2002.
[3] P. Bernstein, V. Hadzilacos, and N. Goodman, Concurrency Control and Recovery in Database Systems. Addison-Wesley, 1987.
[4] K.P. Birman, A. Schiper, and P. Stephenson, Lightweight Causal and Atomic Group Multicast ACM Trans. Computer Systems, vol. 9, no. 3, pp. 272-314, Aug. 1991.
[5] K.P. Birman and R. van Renesse, Reliable Distributed Computing with the ISIS Toolkit. IEEE Press, 1994.
[6] T.D. Chandra and S. Toueg, Unreliable Failure Detectors for Reliable Distributed Systems J. ACM, vol. 43, no. 2, pp. 225-267, Mar. 1996.
[7] D. Dolev and D. Malki, The Transis Approach to High Availability Cluster Communication Comm. ACM, vol. 39, no. 4, pp. 64-70, Apr. 1996.
[8] R. Friedman and R. van Renesse, Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols Technical Report TR95-1527, Computer Science Dept., Cornell Univ. 1995.
[9] R. Goldring, A Discussion of Database Replication Technology Info DB, vol. 1, no. 8, May 1994.
[10] J.N. Gray, P. Helland, P. O'Neil, and D. Shasha, The Dangers of Replication and a Solution Proc. Int'l Conf. Management of Data (ACM-SIGMOD), June 1996.
[11] J.N. Gray and A. Reuter, Transaction Processing: Concepts and Techniques Data Management Systems, San Mateo, Calif.: Morgan Kaufmann, 1993.
[12] V. Hadzilacos and S. Toueg, Fault-Tolerant Broadcasts and Related Problems Distributed Systems, S. Mullender, ed., second ed. chapter 5, Addison-Wesley, 1993.
[13] J. Holliday, D. Agrawal, and A. El Abbadi, The Performance of Database Replication with Group Multicast Proc. Int'l Symp. Fault-Tolerant Computing, 1999.
[14] D.R. Jefferson, Virtual Time ACM Trans. Programming Languages and Systems, vol. 7, no. 3, pp. 404-425, July 1985.
[15] B. Kemme and G. Alonso, A New Approach to Developing and Implementing Eager Database Replication Protocols ACM Trans. Database Systems, vol. 25, no. 3, pp. 333-379, 2000.
[16] B. Kemme, A. Bartoli, and Ö. Babaoglu, Online Reconfiguration in Replicated Databases Based on Group Communication Proc. Int'l Conf. Dependable Systems and Networks, June 2001.
[17] CSIM18 simulation engine (C++ version), Mesquite Software Inc., 3Austin, Texas., 1994.
[18] L.E. Moser, P.M. Melliar-Smith, D.A. Agarwal, R.K. Budhia, and C.A. Lingley-Papadopoulos, Totem: A Fault-Tolerant Multicast Group Communication System Comm. ACM, vol. 39, no. 4, pp. 54-63, Apr. 1996.
[19] Concurrency Control, Transaction Isolation, and Serializability in SQL92 and Oracle7, White Paper, Oracle Corporation, Redwood City, Calif., 1995.
[20] F. Pedone, A Closer Look at Optimistic Replica Control Proc. European Research Seminar on Advances in Distributed Systems, 1997.
[21] F. Pedone, R. Guerraoui, and A. Schiper, Exploiting Atomic Broadcast in Replicated Databases Proc. EuroPar, Sept. 1998.
[22] F. Pedone and A. Schiper, Optimistic Atomic Broadcast Proc. Int'l Symp. Distributed Computing, Sept. 1998.
[23] F. Pedone and A. Schiper, Optimistic Atomic Broadcast: A Pragmatic Viewpoint Theoretical Computer Science, vol. 291, no. 1, pp. 79-101, Jan. 2003.
[24] F.B. Schneider, Implementing Fault-Tolerant Services Using the State Machine Approach: A Tutorial ACM Computing Surveys, vol. 22, no. 4, pp. 299-319, Dec. 1990.
[25] D. Stacey, Replication: DB2, Oracle, or Sybase Database Programming&Design, vol. 7, no. 12, 1994.
[26] I. Stanoi, D. Agrawal, and A. El Abbadi, Using Broadcast Primitives in Replicated Databases Proc. Int'l Conf. Distributed Computing Systems, 1998.
[27] P. Urbán, X. Défago, and A. Schiper, Contention-Aware Metrics for Distributed Algorithms: Comparison of Atomic Broadcast Algorithms Proc. IEEE Int'l Conf. Computer Comm. and Networks, Oct. 2000.
[28] P. Urbán, X. Défago, and A. Schiper, Neko: A Single Environment to Simulate and Prototype Distributed Algorithms Proc. Int'l Conf. Information Networking, Feb. 2001.
[29] R. van Renesse, K.P. Birman, and S. Maffeis, Horus: A Flexible Group Communication System Comm. ACM, vol. 39, no. 4, pp. 76-83, Apr. 1996.

Index Terms:
Replicated databases, optimistic processing, atomic broadcast, transaction processing.
Bettina Kemme, Fernando Pedone, Gustavo Alonso, Andr? Schiper, Matthias Wiesmann, "Using Optimistic Atomic Broadcast in Transaction Processing Systems," IEEE Transactions on Knowledge and Data Engineering, vol. 15, no. 4, pp. 1018-1032, July-Aug. 2003, doi:10.1109/TKDE.2003.1209016
Usage of this product signifies your acceptance of the Terms of Use.