The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Distributed FIFO allocation of identical resources using small shared space
ACM Transactions on Programming Languages and Systems (TOPLAS)
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Bounded concurrrent time-stamp systems are constructible
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Atomic snapshots of shared memory
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
ACM Transactions on Programming Languages and Systems (TOPLAS)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
ISTCS'92 Symposium proceedings on Theory of computing and systems
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
What it means for a concurrent program to satisfy a specification: why no one has specified priority
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A new solution of Dijkstra's concurrent programming problem
Communications of the ACM
Self-stabilizing systems in spite of distributed control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
A new solution to the critical section problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Software structures for ultraparallel computing
Software structures for ultraparallel computing
Computing with faulty shared objects
Journal of the ACM (JACM)
Asynchronous group mutual exclusion (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
A simple local-spin group mutual exclusion algorithm
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Theoretical Computer Science
A Simple Local-Spin Group Mutual Exclusion Algorithm
IEEE Transactions on Parallel and Distributed Systems
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
A Lockout Avoidance Algorithm without Using Time-Stamps for the k-Exclusion Problem
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The congenial talking philosophers problem in computer networks
Distributed Computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A General Resource Allocation Synchronization Problem
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Theoretical Computer Science
Asynchronous group mutual exclusion
Distributed Computing
Safety assurance via on-line monitoring
Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
The k-bakery: local-spin k-exclusion using non-atomic reads and writes
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The space complexity of long-lived and one-shot timestamp implementations
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight space bounds for l-exclusion
DISC'11 Proceedings of the 25th international conference on Distributed computing
The space complexity of unbounded timestamps
DISC'07 Proceedings of the 21st international conference on Distributed Computing
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
Journal of the ACM (JACM)
| Hi-index | 0.00 |
This article presents a solution to thefirst-come, first-enabledℓ-exclusionproblem of Fischer et al. [1979]. Unlike their solution, thissolution does not use powerful read-modify-write synchronizationprimitives and requires only bounded shared memory. Use of theconcurrent timestamp system of Dolevand Shavir [1989] is key in solving the problem within bounded sharedmemory.