A quorum-based self-stabilizing distributed mutual exclusion algorithm

Journal of Parallel and Distributed Computing

Volumn 62, Issue 2, 2002, Pages 284-305

  Nesterenko, Mikhail ^a   Mizuno, Masaaki ^b  

^a KENT STATE UNIVERSITY   (United States)

^b 129 Seaton Hall   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0036194184     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.2001.1792     Document Type: Article

References (25)

1. Billiard quorums on the grid
2. Bounding the unbounded (distributed computing protocols)
3. A class of high performance Maekawa-type algorithms for distributed systems under heavy demand
4. Mutual exclusion in partitioned distributed systems
5. Adaptable recovery using dynamic quorum assignment
6. Token systems that self-stabilize
7. "Self-Stabilizing Rings without Demons"
8. "Distributed Operating Systems and Algorithms"
9. "Cooperating Sequential Processes"
10. Self-stabilizing systems in spite of distributed control
11. Self-stabilization of dynamic systems assuming only read/write atomicity
12. Stabilizing communication protocols
13. Dynamic quorum adjustment for partitioned data
14. Finite-state self-stabilizing protocols in message passing systems
15. Self-stabilizing extensions for message-passing systems
16. Time, clocks and ordering of events in distributed systems
17. A theorem on atomicity in distributed algorithms
18. A √N algorithm for mutual exclusion in decentralized systems
19. Lock-based self-stabilizing distributed mutual exclusion algorithms
20. "Designing Self-Stabilizing Algorithms for Practical Distributed Systems"
21. A simple taxonomy for distributed mutual exclusion algorithms
22. An optimal algorithm for mutual exclusion in computer networks
23. The information structure of distributed mutual exclusion algorithms
24. Data refinement of mixed specifications
25. A taxonomy of distributed mutual exclusion