An algorithm for guaranteeing synchronous ordering of messages
Venkatesh V. Murty, Vijay K. Garg · 2002
The paper studies the characteristics of synchronous ordering of messages. Synchronous ordering of messages defines synchronous communication based on the causality rather than time. We present the sufficient conditions, based on the causality relations, for any algorithm to provide synchronous ordering. We also propose an algorithm using acknowledgment messages to implement the sufficient conditions. The algorithm is deadlock-free, and provides a higher degree of concurrency than existing algorithms.>