Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Conditions on input vectors for consensus solvability in asynchronous distributed systems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
On beyond registers: wait-free readable objects
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
A hierarchy of conditions for consensus solvability
Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Space-optimal multi-writer snapshot objects are slow
Proceedings of the twenty-first annual symposium on Principles of distributed computing
Distributed Agreement and Its Relation with Error-Correcting Codes
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Condition-Based Protocols for Set Agreement Problems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Even Better DCAS-Based Concurrent Deques
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
A tight time lower bound for space-optimal implementations of multi-writer snapshots
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Collective asynchronous reading with polylogarithmic worst-case overhead
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Efficient synchronous snapshots
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Linear Lower Bounds on Real-World Implementations of Concurrent Objects
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Time-space tradeoffs for implementations of snapshots
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Single-scanner multi-writer snapshot implementations are fast!
Proceedings of the twenty-fifth annual ACM symposium on Principles of 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
The complexity of updating multi-writer snapshot objects
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Time lower bounds for implementations of multi-writer snapshots
Journal of the ACM (JACM)
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
Locks Considered Harmful: A Look at Non-traditional Synchronization
SEUS '08 Proceedings of the 6th IFIP WG 10.2 international workshop on Software Technologies for Embedded and Ubiquitous Systems
A Lock-Based STM Protocol That Satisfies Opacity and Progressiveness
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
From adaptive renaming to set agreement
Theoretical Computer Science
Visiting Gafni's Reduction Land: From the BG Simulation to the Extended BG Simulation
SSS '09 Proceedings of the 11th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Of Choices, Failures and Asynchrony: The Many Faces of Set Agreement
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Interrupting snapshots and the Java™ size() method
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Help when needed, but no more: efficient read/write partial snapshot
DISC'09 Proceedings of the 23rd international conference on Distributed computing
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
The complexity of updating multi-writer snapshot objects
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
How hard is it to take a snapshot?
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Interrupting snapshots and the JavaTM size method
Journal of Parallel and Distributed Computing
The renaming problem in shared memory systems: An introduction
Computer Science Review
Faster than optimal snapshots (for a while): preliminary version
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Computability in distributed computing: a Tutorial
ACM SIGACT News
| Hi-index | 0.00 |
The atomic snapshot object is an important primitive used for the design and verification of wait-free algorithms in shared-memory distributed systems. A snapshot object is a shared data structure partitioned into segments. Processors can either update an individual segment or instantaneously scan all segments of the object. This paper presents an implementation of an atomic snapshot object in which each high-level operation (scan or update) requires O(n log n) low-level operations on atomic read/write registers.