The drinking philosophers problem
ACM Transactions on Programming Languages and Systems (TOPLAS) - Lecture notes in computer science Vol. 174
The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
On the minimal synchronism needed for distributed consensus
Journal of the ACM (JACM)
On processor coordination using asynchronous hardware
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing multi-reader atomic values from non-atomic values
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
A protocol for wait-free, atomic, multi-reader shared variables
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Constructing two-writer atomic registers
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
The global time assumption and semantics for concurrent systems
PODC '88 Proceedings of the seventh annual ACM Symposium on Principles of distributed computing
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Bounded polynomial randomized consensus
Proceedings of the eighth annual ACM Symposium on Principles of distributed 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
Sharing memory robustly in message-passing systems
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Atomic snapshots of shared memory
Journal of the ACM (JACM)
A bounded first-in, first-enabled solution to the l-exclusion problem
ACM Transactions on Programming Languages and Systems (TOPLAS)
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Computing with faulty shared objects
Journal of the ACM (JACM)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Space and time efficient self-stabilizing l-exclusion in tree networks
Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
A Self-stabilizing Token-Based k-out-of-l Exclusion Algorithm
Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
A New Efficient Tool for the Design of Self-Stabilizing l-Exclusion Algorithms: The Controller
WSS '01 Proceedings of the 5th International Workshop on Self-Stabilizing Systems
Tight Space Self-stabilizing Uniform l-Mutual Exclusion
ICDCS '01 Proceedings of the The 21st International Conference on Distributed Computing Systems
Distributed Computing
Self-stabilizing multi-token rings
Distributed Computing
Using local-spin k-exclusion algorithms to improve wait-free object implementations
Distributed Computing
A new self-stabilizing k-out-of-l exclusion algorithm on rings
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
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
Tight space bounds for l-exclusion
DISC'11 Proceedings of the 25th international conference on Distributed computing
Hi-index | 0.00 |
Most of the research in concurrency control has been based on the existence of strong synchronization primitives such as test and set. Following Lamport, recent research promoting the use of weaker primitives, “safe” rather than “atomic,” has resulted in construction of atomic registers from safe ones, in the belief that they would be useful tools for process synchronization. We argue that the properties provided by atomic operations may be too powerful, masking core difficulties of problems and leading to inefficiency. We therefore advocate a different approach, to skip the intermediate step of achieving atomicity, and solve problems directly from safe registers. Though it has been shown that “test and set” cannot be implemented from safe registers, we show how to achieve a fair solution to l-exclusion, a classical concurrency control problem previously solved assuming a very powerful form of atomic “test and set”. We do so using safe registers alone and without introducing atomicity. The solution is based on the construction of a simple novel non-atomic synchronization primitive.