A simple scheme to construct k-coteries with O(√N) uniform quorum sizes

Information Processing Letters

Volumn 59, Issue 1, 1996, Pages 31-36

  Kuo, Yu Chen ^a   Huang, Shing Tsaan ^a  

^a NATIONAL TSING HUA UNIVERSITY   (Taiwan)

Author keywords

Concurrency; Distributed systems; Fault tolerance; k coterie; k mutual exclusion

Indexed keywords

EID: 0012829467     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/0020-0190(96)00089-0     Document Type: Article

References (6)

1. S. Fujita, M. Yamashita and T. Ae, Distributed k-mutual exclusion problem and k-coteries, in: Proc. 2nd Internat. Symp. on Algorithms, Lecture Notes in Computer Science 557 (Springer, Berlin, 1991) 22-31.
2. H. Garcia-Molina and D. Barbara, How to assign votes in a distributed systems, J. ACM 32 (1985) 841-860.
3. S.T. Huang, J.R. Jiang and Y.C. Kuo, K-coteries for fault-tolerant k entries to a critical section, in: Proc. 13th IEEE Internal. Conf. on Distributed Computer Systems (1993) 74-81.
4. H. Kakugawa, S. Fujita, M. Yamashita and T. Ae, Availability of k-coterie, IEEE Trans. Comput. Systems 42 (1993) 553-558.
5. M.L. Neilsen and M. Mizuno, Nondominated k-coteries for multiple mutual exclusion, Inform. Process. Lett. 50 (1994) 247-252.
6. R.H. Thomas, A majority consensus approach to concurrency control, ACM Trans. Database Systems 4 (1979) 180-209.