Horus: a flexible group communication system
Communications of the ACM
Masking the overhead of protocol layering
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
An adaptive totally ordered multicast protocol that tolerates partitions
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A new approach to developing and implementing eager database replication protocols
ACM Transactions on Database Systems (TODS)
Total order communications: a practical analysis
EDCC'05 Proceedings of the 5th European conference on Dependable Computing
Tuning paxos for high-throughput with batching and pipelining
ICDCN'12 Proceedings of the 13th international conference on Distributed Computing and Networking
Optimizing Paxos with batching and pipelining
Theoretical Computer Science
| Hi-index | 0.02 |
This paper compares the throughput and latency of four protocols that provide total ordering. Two of these protocols are measured with and without message packing. We used a technique that buffers application messages for a short period of time before sending them, so more messages are packed together. The main conclusion of this comparison is that message packing influences the performance of total ordering protocols under high load overwhelmingly more than any other optimization that was checked in this paper, both in terms of throughput and latency. This improved performance is attributed to the fact that packing messages reduces the header overhead for messages, the contention on the network, and the load on the receiving CPUs.