Coterie join operation and tree structured k-coteries

IEEE Transactions on Parallel and Distributed Systems

Volumn 12, Issue 9, 2001, Pages 865-874

  Harada, Takashi ^a,b   Yamashita, Masafumi ^a,c  

^a IEEE   (Japan)

^b HIROSHIMA UNIVERSITY   (Japan)

^c KYUSHU UNIVERSITY   (Japan)

Author keywords

Availability; Distributed systems; K coteries; K mutual exclusion problem; K semicoteries; Message complexity; Nondominatedness; Quorums

Indexed keywords

QUORUMS;

ALGORITHMS; SET THEORY; THEOREM PROVING; TREES (MATHEMATICS);

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0035439108     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.954617     Document Type: Article

References (23)

1. An efficient and fault-tolerant solution for distributed mutual exclusion
2. Analysis of quorum-based protocols for distributed (k+1)- exclusion
3. The reliability of voting mechanisms
4. Generating and approximating nondominated coteries
5. The grid protocol: A high performance scheme for maintaining replicated data
6. Performance characterization of the tree quorum algorithm
7. Optimal coteries and voting schemes
8. Distributed k-mutual exclusion problem and k-coteries
9. Weighted voting for replicated data
10. How to assign votes in a distributed systems
11. K-coteries for fault-tolerant k entries to a critical section
12. A theory of coteries: Mutual exclusion in distributed systems
13. Obtaining nondominated k-coteries for fault-tolerant distributed k-mutual exclusion
14. A distributed k-mutual exclusion algorithm using k-coterie
15. Hierarchical quorum consensus: A new algorithm for managing replicated data
16. A geometric approach for constructing coteries and k-coteries
17. A √N algorithm for mutual exclusion in decentralized systems
18. Coterie join algorithm
19. Nondominated k-coteries for multiple mutual exclusion
20. Erratum to nondominated k-coteries for multiple mutual exclusion
21. A distributed algorithm for multiple entries to a critical section
22. Another distributed algorithm for multiple entries to a critical section
23. Message complexity of the tree quorum algorithm