Implementation of an Adaptive Total Ordering Protocol
Yoshihiro Yasutake, Shinobu Izumi, Kentaro Oda, Takaichi Yoshida · 2007
In distributed systems, the communication among group members often needs ordered messages to guarantee that every member receives the messages in the same order. Oftentimes, changes in distributed computing environment occur and this undermines the assumption of any ordering algorithm. Therefore, it is difficult to presume a suitable ordering algorithm and apply a single algorithm throughout the lifetime of the system. In this paper, we present an adaptive total ordering protocol and its implementation on our reconfigurable object model. Our adaptive protocol selects a suitable ordering protocol from optimistic and pessimistic total ordering protocols dynamically depending on the runtime environment. With optimistic protocol, it is possible to reduce the affect of the network latency which is not negligible in the pessimistic protocol, because the optimistic protocol delivers messages immediately after receiving them.