The congenial talking philosophers problem in computer networks

Distributed Computing

Volumn 15, Issue 3, 2002, Pages 155-175

  Joung, Yuh Jzer ^a  

^a NATIONAL TAIWAN UNIVERSITY   (Taiwan)

Author keywords

Distributed algorithms; Group mutual exclusion; Message passing; Mutual exclusion; Resource allocation

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER SIMULATION; DATA COMMUNICATION SYSTEMS; PHILOSOPHICAL ASPECTS; RESOURCE ALLOCATION; THEOREM PROVING;

CONGENIAL TALKING PHILOSOPHERS PROBLEM; DISTRIBUTED ALGORITHMS; GROUP MUTUAL EXCLUSION; MESSAGE PASSING;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0036649643     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004460100069     Document Type: Article

References (25)

1. A bounded first-in, first-enabled solution to the ℓ-exclusion problem
2. Elegant solutions for group mutual exclusion problem
3. Distributed algorithms for multiple entries to a critical section with priority
4. A distributed K-mutual exclusion algorithm
5. Concurrent control with readers and writers
6. Resource allocation with immunity to limited process failure (preliminary report)
7. A quorum based k-mutual exclusion by weighted k-quorum systems
8. How to assign votes in a distributed system
9. A note on group mutual exclusion
10. Communicating sequential processes
11. Asynchronous group mutual exclusion (extended abstract)
12. A distributed k-mutual exclusion algorithm using k-coterie
13. A simple local-spin group mutual exclusion algorithm
14. Time, clocks and the ordering of events in a distributed system
15. A √N algorithm for mutual exclusion in decentralized systems
16. Virtual time and global states in distributed systems
17. A distributed algorithm for multiple entries to a critical section
18. A simple taxonomy for distributed mutual exclusion algorithms
19. An optimal algorithm for mutual exclusion in computer networks
20. The information structure of distributed mutual exclusion algorithms
21. A taxonomy of distributed mutual exclusion
22. Another distributed algorithm for multiple entries to a critical section