Delay optimal coteries on regular symmetric networks

Computer Standards and Interfaces

Volumn 23, Issue 4, 2001, Pages 341-353

  Saxena, P C ^a   Gupta, Sangita ^a   Rai, Jagmohan ^b,c  

^a JAWAHARLAL NEHRU UNIVERSITY   (India)

^b UNIVERSITY OF DELHI   (India)

^c NONE   (India)

Author keywords

Coterie; Delay optimal coterie; Message complexity; Mutual exclusion

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SYSTEMS PROGRAMMING; DISTRIBUTED COMPUTER SYSTEMS; RESPONSE TIME (COMPUTER SYSTEMS);

DELAY OPTIMAL COTERIE;

DATA COMMUNICATION SYSTEMS;

EID: 0034908974     PISSN: 09205489     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0920-5489(01)00080-0     Document Type: Article

References (23)

1. An efficient and fault tolerant solution for distributed mutual exclusion
2. Billiard quorums on the grid
3. A group-theoretic model for symmetric interconnection networks
4. Multi-dimensional voting
5. The grid protocol: A high performance scheme for maintaining replicated data
6. Optimal coteries and voting schemes
7. Delay optimal quorum consensus for distributed systems
8. How to assign votes in a distributed system
9. Weighted voting for replicated data
10. A general scheme for token and tree based distributed mutual exclusion algorithms
11. Optimal coteries for rings and related networks
12. Two new quorum based algorithms for distributed mutual exclusion
13. A √N algorithm for mutual exclusion in decentralized systems
14. A log(n) distributed mutual exclusion algorithm based on path reversal
15. Folded petersen cube networks: New competitors for the hypercubes
16. A performance comparison of token and tree based mutual exclusion algorithms on chordal rings
17. A token-based delay optimal algorithm for mutual exclusion in distributed systems
18. A distributed mutual exclusion algorithm
19. A majority consensus approach to concurrency control
20. A new family of Cayley graph interconnection networks of constant degree four