Axioms for memory access in asynchronous hardware systems
ACM Transactions on Programming Languages and Systems (TOPLAS) - The MIT Press scientific computation series
The mutual exclusion problem: partII—statement and solutions
Journal of the ACM (JACM)
Hierarchical correctness proofs for distributed algorithms
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Toward a non-atomic era: l-exclusion as a test case
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
On achieving consensus using a shared memory
PODC '88 Proceedings of the seventh 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
Linearizability: a correctness condition for concurrent objects
ACM Transactions on Programming Languages and Systems (TOPLAS)
Fast randomized consensus using shared memory
Journal of Algorithms
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Time-and space-efficient randomized consensus
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
Wait-free data structures in the asynchronous PRAM model
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
ACM Transactions on Programming Languages and Systems (TOPLAS)
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)
A new solution to the critical section problem
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Composite Registers
Multiple-Writer Composite Registers
Multiple-Writer Composite Registers
The Virtue of Patience: Concurrent Programming with and Without Waiting
The Virtue of Patience: Concurrent Programming with and Without Waiting
Axiomatic proof techniques for parallel programs.
Axiomatic proof techniques for parallel programs.
Are wait-free algorithms fast?
Journal of the ACM (JACM)
Sharing memory robustly in message-passing systems
Journal of the ACM (JACM)
Computing with faulty shared objects
Journal of the ACM (JACM)
Modular competitiveness for distributed algorithms
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
The power of multi-objects (extended abstract)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Time and space lower bounds for non-blocking implementations (preliminary version)
PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
The decidability of distributed decision tasks (extended abstract)
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
Towards a topological characterization of asynchronous complexity
PODC '97 Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing
The unified structure of consensus: a layered analysis approach
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Round-by-round fault detectors (extended abstract): unifying synchrony and asynchrony
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Fast, wait-free (2k-1)-renaming
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Simple and efficient bounded concurrent timestamping and the traceable use abstraction
Journal of the ACM (JACM)
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
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
The concurrency hierarchy, and algorithms for unbounded concurrency
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
New Perspectives in Distributed Computing
MFCS '99 Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science
Randomized two-process wait-free test-and-set
Distributed Computing
Nonblocking k-compare-single-swap
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
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
Algorithms adapting to point contention
Journal of the ACM (JACM)
A classification of wait-free loop agreement tasks
Theoretical Computer Science - Special issue: Distributed computing
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Micro-Checkpointing: Checkpointing for Multithreaded Applications
IOLTW '00 Proceedings of the 6th IEEE International On-Line Testing Workshop (IOLTW)
Conditions on input vectors for consensus solvability in asynchronous distributed systems
Journal of the ACM (JACM)
Hundreds of impossibility results for distributed computing
Distributed Computing - Papers in celebration of the 20th anniversary of PODC
A pleasant stroll through the land of infinitely many creatures
ACM SIGACT News
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
Computable obstructions to wait-free computability
Distributed Computing
Distributed Computing
Randomized naming using wait-free shared variables
Distributed Computing
An adaptive collect algorithm with applications
Distributed Computing
An optimal multi-writer snapshot algorithm
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Cooperative asynchronous update of shared memory
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Atomic snapshots using lattice agreement
Distributed Computing
The combined power of conditions and failure detectors to solve asynchronous set agreement
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Wait-free computing: an introductory lecture
Future Generation Computer Systems - Special issue: Parallel computing technologies
Time and space optimal implementations of atomic multi-writer register
Information and Computation
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
Understanding Tradeoffs in Software Transactional Memory
Proceedings of the International Symposium on Code Generation and Optimization
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
On the weakest failure detector ever
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing
Failure detectors are schedulers
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)
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Asynchronous exclusive selection
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
An impossibility about failure detectors in the iterated immediate snapshot model
Information Processing Letters
Maintaining Consistent Transactional States without a Global Clock
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
The Iterated Restricted Immediate Snapshot Model
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
A Scalable and Oblivious Atomicity Assertion
CONCUR '08 Proceedings of the 19th international conference on Concurrency Theory
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
Fast memory snapshot for concurrent programmingwithout synchronization
Proceedings of the 23rd international conference on Supercomputing
Integrity Protection for Revision Control
ACNS '09 Proceedings of the 7th International Conference on Applied Cryptography and Network Security
Dynamic atomic storage without consensus
Proceedings of the 28th ACM symposium on Principles of distributed computing
Max registers, counters, and monotone circuits
Proceedings of the 28th ACM symposium on Principles of distributed computing
Inherent limitations on disjoint-access parallel implementations of transactional memory
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
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
NB-FEB: A Universal Scalable Easy-to-Use Synchronization Primitive for Manycore Architectures
OPODIS '09 Proceedings of the 13th International Conference on Principles 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
Time and space optimal implementations of atomic multi-writer register
Information and Computation
Compositional competitiveness for distributed algorithms
Journal of Algorithms
Iterative computations with ordered read-write locks
Journal of Parallel and Distributed Computing
From renaming to set agreement
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Tight group renaming on groups of size g is equivalent to g-consensus
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
The multiplicative power of consensus numbers
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The topology of shared-memory adversaries
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Data-centric reconfiguration with network-attached disks
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
The x-wait-freedom progress condition
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Recursion in distributed computing
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
On adaptive renaming under eventually limited contention
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Run-time verification of optimistic concurrency
RV'10 Proceedings of the First international conference on Runtime verification
Distributed programming with tasks
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Turning adversaries into friends: simplified, made constructive, and extended
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
Relating L-resilience and wait-freedom via hitting sets
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Lightweight parallel accumulators using C++ templates
Proceedings of the 4th International Workshop on Multicore Software Engineering
Linearizable implementations do not suffice for randomized distributed computation
Proceedings of the forty-third annual ACM symposium on Theory of computing
On the power of hardware transactional memory to simplify memory management
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
From bounded to unbounded concurrency objects and back
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
A survey on some recent advances in shared memory models
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Help when needed, but no more: Efficient read/write partial snapshot
Journal of Parallel and Distributed Computing
DISC'11 Proceedings of the 25th international conference on Distributed computing
The Complexity of Early Deciding Set Agreement
SIAM Journal on Computing
The complexity of updating multi-writer snapshot objects
ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Adapting to point contention with long-lived safe agreement
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Polylogarithmic concurrent data structures from monotone circuits
Journal of the ACM (JACM)
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
How hard is it to take a snapshot?
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
What can be implemented anonymously?
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Space and step complexity efficient adaptive collect
DISC'05 Proceedings of the 19th international conference on Distributed Computing
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
On the implementation of concurrent objects
Dependable and Historic Computing
A unified theory of program logics: an approach based on the π-calculus
VoCS'08 Proceedings of the 2008 international conference on Visions of Computer Science: BCS International Academic Conference
Relaxed synchronization with ordered read-write locks
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing
An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
Electronic Notes in Theoretical Computer Science (ENTCS)
Theoretical Computer Science
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
Transactional scheduling for read-dominated workloads
Journal of Parallel and Distributed Computing
Computability in distributed computing: a Tutorial
ACM SIGACT News
The Space Complexity of Long-Lived and One-Shot Timestamp Implementations
Journal of the ACM (JACM)
| Hi-index | 0.03 |
This paper introduces a general formulation ofatomic snapshot memory, a sharedmemory partitioned into words written(updated) by individual processes, orinstantaneously read (scanned) in itsentirety. This paper presents three wait-free implementations of atomicsnapshot memory. The first implementation in this paper uses unbounded(integer) fields in these registers, and is particularly easy tounderstand. The second implementation uses bounded registers. Itscorrectness proof follows the ideas of the unbounded implementation.Both constructions implement a single-writer snapshot memory, in whicheach word may be updated by only one process, from single-writer,n-reader registers. The thirdalgorithm implements a multi-writer snapshot memory from atomicn-writer,n-reader registers, again echoing keyideas from the earlier constructions. All operations require&THgr;(n2) readsand writes to the component shared registers in the worst case.—Authors' Abstract