How to share concurrent wait-free variables
Journal of the ACM (JACM)
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
Theoretical Computer Science
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
Fair and Efficient Mutual Exclusion Algorithms (Extended Abstract)
Proceedings of the 13th International Symposium on Distributed Computing
Simple Wait-Free Multireader Registers
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
A Simple, Memory-Efficient Bounded Concurrent Timestamping Algorithm
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Simple Mutual Exclusion Algorithms Based on Bounded Tickets on the Asynchronous Shared Memory Model
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Avoiding State Explosion for Distributed Systems with Timestamps
FME '01 Proceedings of the International Symposium of Formal Methods Europe on Formal Methods for Increasing Software Productivity
Randomized two-process wait-free test-and-set
Distributed Computing
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Using elimination to implement scalable and lock-free FIFO queues
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
The DHCP Failover Protocol: A Formal Perspective
FORTE '07 Proceedings of the 27th IFIP WG 6.1 international conference on Formal Techniques for Networked and Distributed Systems
DISC '08 Proceedings of the 22nd international symposium on Distributed Computing
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Brief announcement: sharing memory in a self-stabilizing manner
DISC'10 Proceedings of the 24th international conference on 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
Pragmatic self-stabilization of atomic memory in message-passing systems
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
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 |
We introduce concurrent time-stamping, a paradigm that allows processes to temporally order concurrent events in an asynchronous shared-memory system. Concurrent time-stamp systems are powerful tools for concurrency control, serving as the basis for solutions to coordination problems such as mutual exclusion, $\ell$-exclusion, randomized consensus, and multiwriter multireader atomic registers. Unfortunately, all previously known methods for implementing concurrent time-stamp systems have been theoretically unsatisfying since they require unbounded-size time-stamps---in other words, unbounded-size memory.This work presents the first bounded implementation of a concurrent time-stamp system, providing a modular unbounded-to-bounded transformation of the simple unbounded solutions to problems such as those mentioned above. It allows solutions to two formerly open problems, the bounded-probabilistic-consensus problem of Abrahamson and the fifo-$\ell$-exclusion problem of Fischer, Lynch, Burns and Borodin, and a more efficient construction of multireader multiwriter atomic registers.