Abstract
Abstract
Quorum system of (h, k)-majority coterie is a set system which elements are a collection of sets k-coterie provided that each element satisfies bicoterie and disjoint properties. Some of related studies have tried to make the construction of this quorum system but constrained by the problem of generalization. In this paper, to overcome the problem we first compile an equation to determine the size of quoru m. Then we arrange quoru ms that satisfies the equation in a quorum system. The way are (a) divide the universe set into m parts so that h parts are separated, (b) construct a quorum that satisfie k-coterie, (c) construct a quorum system that satisfie bicoterie and disjoint properties.
Subject
General Physics and Astronomy
Reference7 articles.
1. How to assign votes in a distributed system;Molina;Journal of The ACM,1985
2. A distributed -mutual exclusion algorithm using -coterie;Kakugawa;Elsevier Information Processing Letters,1992
3. A teory of coteries: mutual exclusion in distributed systems;Ibaraki;IEEE Transaction on Parallel and Distributed Computing,1993
4. On quorum systems for group resources with bounded capacity;Joung,2004
5. A quorum based-resource allocation algorithm;Lawi,2006