The mutual exclusion problem: part I—a theory of interprocess communication
Journal of the ACM (JACM)
Towards an understanding of unbounded variables in asynchronous systems
Information Processing Letters
Concurrent timestamping made simple
ISTCS'92 Symposium proceedings on Theory of computing and systems
Atomic snapshots of shared memory
Journal of the ACM (JACM)
PODC '93 Proceedings of the twelfth annual ACM symposium on Principles of distributed computing
Journal of the ACM (JACM)
Bounded Concurrent Time-Stamping
SIAM Journal on Computing
Atomic Snapshots in O (n log n) Operations
SIAM Journal on Computing
SIAM Journal on Computing
Concurrent Reading While Writing
ACM Transactions on Programming Languages and Systems (TOPLAS)
Concurrent reading and writing
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
How to Construct an Atomic Variable (Extended Abstract)
Proceedings of the 3rd International Workshop on Distributed Algorithms
A Concurrent Time-Stamp Scheme which is Linear in Time and Space
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity
WDAG '91 Proceedings of the 5th International Workshop on Distributed Algorithms
Bounded concurrent timestamp systems using vector clocks
Journal of the ACM (JACM)
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
Theoretical Computer Science
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Constructing regular variables in message passing systems
Journal of Parallel and Distributed Computing
Time-optimal, space-efficient single-scanner snapshots & multi-scanner snapshots using CAS
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
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
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.01 |
In a timestamping system, processors repeatedly choose timestamps so that the order of the timestamps obtained reflects the real-time order in which they were requested. Concurrent timestamping systems permit requests by multiple processors to be issued concurrently; in bounded timestamping systems the sizes of the timestamps and the size and number of shared variables are bounded. An algorithm is wait-free if there exists an a priori bound on the number of steps a processor must take in order to make progress, independent of the action or inaction of other processors. Letting n denote the number of procesors, we construct a simple wait-free bounded concurrent timestamping system requiring O(n) steps (accesses to shared memory) for a processor to read the current timestamps and determine the order among them, and O(n) steps to generate a timestamp, independent of the actions of the other processors. In addition, we introduce and implement the traceable use abstraction, a new primitive providing “inventory control” over values introduced by processors in the course of an algorithm execution. This abstraction has proved to be of great value in converting unbounded algorithms to bounded ones {Attiya and Rachman 1998; Dwork et al. 1992; 1993].