Subscribe

Issue No.05 - September (1992 vol.3)

pp: 582-590

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.159041

ABSTRACT

Given a set of nodes in a distributed system, a coterie is a collection of subsets of the set of nodes such that any two subsets have a non empty intersection and are not properly contained in one another. A subset of nodes in a coterie is called a quorum. An algorithm, called the join algorithm, which takes nonempty coteries as input, and returns a new, larger coterie called a composite coterie is introduced. It is proved that a composite coterie is nondominated if and only if the input coteries are nondominated.Using the algorithm, dominated or nondominated coteries may be easily constructed for a large number of nodes. An efficient method for determining whether a given set of nodes contains a quorum of a composite coterie is presented. As an example, tree coteries are generalized using the join algorithm, and it is proved that tree coteries are nondominated. It is shown that the join algorithm may be used to generate read and write quorums which may be used by a replica control protocol.

INDEX TERMS

Index Termsdistributed system; nonempty intersection; nonempty coteries; composite coterie; treecoteries; join algorithm; read and write quorums; replica control protocol; distributedalgorithms; trees (mathematics)

CITATION

M.L. Nielsen, M. Mizuno, "Coterie Join Algorithm",

*IEEE Transactions on Parallel & Distributed Systems*, vol.3, no. 5, pp. 582-590, September 1992, doi:10.1109/71.159041