Notes on Maekawa´s O(√N) distributed mutual exclusion algorithm

Maekawa´s algorithm is one of well-known distributed mutual exclusion algorithms and requires only O(√N) messages per CS execution, where N is the number of sites in the system. However, Maekawa´s algorithm can work well only if the pipelining property is satisfied (i.e., between any pair of sites, messages are delivered in the order in which they are sent). In this paper, we show how to modify Maekawa´s algorithm to let it work well even when the pipelining property is no longer satisfied. Moreover, we discuss some interesting results of a simulation study of Maekawa´a algorithm which show that more than N messages may be needed in Maekawa´s algorithm