A quorum based k-mutual exclusion by weighted k-quorum systems

Abstract

In this paper, we propose a scheme for solving the k-mutual exclusion problem in a distributed system, which is a generalization of the quorum based scheme for solving the distributed mutual exclusion problem. The proposed scheme uses a set of weighted quorums as the underlying structure, which can be constructed from any quorum system by applying the technique of k-decomposition. The notion of balanced k-decomposition and a realization of weighted k-quorum systems without k-decomposition are also given.