An Atomic-Multicast Service for Scalable In-Memory Transaction Systems

Atomic Multicasts are central to the management of replicated data in distributed systems. Previous work has proven the effectiveness of utilising atomic multicasts, opposed to the classic two-phase commit, to coordinate transactions in in-memory databases. However, the current family of protocols utilised by such systems do not scale as the number of destinations increases. We propose that atomic multicasts should not occur between database nodes, instead transaction ordering should be exposed as a service that is provided by a dedicated set of nodes. Our performance study shows a clear improvement in transaction throughput and latency as the number of participants in a transaction increases.

[1]  Fernando Pedone,et al.  P-Store: Genuine Partial Replication in Wide Area Networks , 2010, 2010 29th IEEE Symposium on Reliable Distributed Systems.

[2]  Luís E. T. Rodrigues,et al.  Exploiting Total Order Multicast in Weakly Consistent Transactional Caches , 2011, 2011 IEEE 17th Pacific Rim International Symposium on Dependable Computing.

[3]  Newtop: a fault-tolerant group communication protocol , 1995, Proceedings of 15th International Conference on Distributed Computing Systems.

[4]  Leslie Lamport,et al.  Paxos Made Simple , 2001 .

[5]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[6]  Ryan Emerson,et al.  A Non-Blocking Atomic-Multicast Service for Scalable In-memory Transaction Systems , 2014 .

[7]  Nancy A. Lynch,et al.  Impossibility of distributed consensus with one faulty process , 1983, PODS '83.