Distributed dynamic channel allocation (DDCA) is a fundamental resource management problem in mobile cellular networks. It has a flavor of distributed mutual exclusion but is not exactly a mutual exclusion problem (because a channel may be reused in different cells). In this paper, we establish the exact relationship between the two problems. Specifically, we introduce the problem of relaxed mu...

Group mutual exclusion is an interesting generalization of the mutual exclusion problem. This problem was introduced by Joung, and some algorithms for the problem have been proposed by incorporating mutual exclusion algorithms. Group mutual exclusion occurs naturally in a situation where a resource can be shared by processes of the same group, but not by processes of different groups. It is als...

In this paper, we present a quorum based algorithm for (m,h, k)-resource allocation problem, i.e., a conflict resolution problem to control a distributed system consisting of n users and m critical resources so that the following two requirements are satisfied: at any given time, at most h (out of m) resources can be utilized by some users simultaneously and each resource is utilized by at most...

Spring 1996 hared-memory multiprocessor systems must provide facilities called critical sections for programs to share physical and logical resources. Only one processor at a time can process a CS. This requires a method to ensure mutually exclusive access to the logically atomic operations of a shared CS. Two approaches to mutual exclusion are hardware algorithms, which use primitives, and sof...