Dining philosophers that tolerate malicious crashes

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2002, Pages 191-198

  Nesterenko, Mikhail ^a   Arora, Anish ^a  

^a KENT STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER PROGRAM LISTINGS; FAULT TOLERANT COMPUTER SYSTEMS; GRAPH THEORY; THEOREM PROVING;

CRASH FAILURE LOCALITY;

COMPUTER SYSTEM RECOVERY;

EID: 0036367475     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (18)

1. Mutual exclusion between neighboring nodes in an arbitrary system graph that stabilizes using read/write atomicity
2. Self-stabilizing local mutual exclusion and daemon refinement
3. Fault-tolerance and self-stabilization: Impossibility results and solutions using self-stabilizing failure detectors
4. On ftss-solvable distributed problems
5. The drinking philosopher's problem
6. Efficient fault-tolerant algorithms for distributed resource allocation
7. Localizing failures in distributed synchronization
8. Self stabilizing systems in spite of distributed control
9. Impossibility of distributed consensus with one faulty processor
10. The alternator
11. The fuzzy philosophers
12. Distributed computing: Models and methods
13. A transformation of self-stabilizing serial model programs for asynchronous parallel computing environments
14. Stabilization-preserving atomicity refinement
15. Reaching agreement in the presence of faults
16. A new distributed resource-allocation algorithm with optimal failure locality
17. An algorithm with optimal failure locality for the dining philosophers problem