Distributed mutual exclusion algorithms on a ring of clusters

Abstract

We propose an architecture that consists of a ring of clusters for distributed mutual exclusion algorithms. Each node on the ring represents a cluster of nodes and implements various distributed mutual exclusion algorithms on behalf of any member in the cluster it represents. We show the implementation of Ricart-Agrawala and a Token-based algorithm on this architecture. The message complexities for both algorithms are reduced substantially with this architecture as well as obtaining better response times due to parallel processing in the clusters... © Springer-Verlag Berlin Heidelberg 2004.