An O(√n) Mutual Exclusion Algorithm in Decentralized Systems using Queue Migration

P. Chaudhuri and T. Edward (Barbados)


Mutual exclusion, critical section, distributed algorithm, computer network, queue migration, message complexity


In this paper a distributed algorithm is proposed that realises mutual exclusion among n nodes in a computer network. There is no common or global memory shared by the nodes and there is no global controller. The nodes of the network communicate among themselves by exchanging messages only. The proposed algorithm is based on queue migration and achieves a message complexity of O(n) per mutual exclusion invocation. Under heavy load, the number of messages required per mutual exclusion approaches 2.

Important Links:

Go Back