Packing Messages as a Tool for Boosting the Performance of Total Ordering Protocols

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 bu ers 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 in uences 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. This work was supported by ARPA/ONR grant N00014-92-J-1866 0 

• Type: Conference
• Year: 1997
• Where: HPDC
• Authors: Roy Friedman, Robbert van Renesse
• Keywords: Distributed And Parallel Computing, Ers Application Messages, HPDC 1997, Message Packing, Total Ordering