A SIMPLE SCHEME TO CONSTRUCT K-COTERIES WITH O(ROOT-N) UNIFORM QUORUMSIZES

Authors
KUO YC HUANG ST
Citation
Yc. Kuo et St. Huang, A SIMPLE SCHEME TO CONSTRUCT K-COTERIES WITH O(ROOT-N) UNIFORM QUORUMSIZES, Information processing letters, 59(1), 1996, pp. 31-36
Citations number
6
Categorie Soggetti
Information Science & Library Science","Computer Science Information Systems
Journal title
Information processing letters → ACNP
ISSN journal
00200190
Volume
59
Issue
1
Year of publication
1996
Pages
31 - 36
Database
ISI
SICI code
0020-0190(1996)59:1<31:ASSTCK>2.0.ZU;2-7
Abstract
In this paper, we propose a simple scheme to construct k-coteries for the distributed k-mutual exclusion problem. The constructed k-coteries are uniform: each quorum in a k-coterie has the same size, O(root N), where N denotes the number of sites in the system.