A static-tree-based algorithm for the 'any one from any subset of a set of critical sections' problem in distributed computing systems

In the basic version of the distributed mutual exclusion problem, only one resource is under contention. If there are many types and instances of shared resources in a distributed system, a node may want to access the first available resource from any given subset of these resources. In this paper, we present a static tree based solution to this problem. The number of messages generated per critical section execution can be from 0 to 2(N-1), where N is the number of nodes in the system. A significant advantage of the presented algorithm is that the upper bound on the number of messages generated per critical section execution, namely 2(N-1), is independent of the number of resources covered by the algorithm.<
>