Atomic snapshots of shared memory
From MaRDI portal
Recommendations
Cited in
(only showing first 100 items - show all)- From adaptive renaming to set agreement
- A criterion for atomicity
- Beyond atomic registers: Bounded wait-free implementations of nontrivial objects
- Linearizable read/write objects
- Simple atomic snapshots: A linear complexity solution with unbounded time-stamps
- Can an operation both update the state and return a meaningful value in the asynchronous PRAM model?
- Collapsibility of read/write models using discrete Morse theory
- Geometric and combinatorial views on asynchronous computability
- Anonymous obstruction-free (n,k)-set agreement with n-k+1 atomic read/write registers
- The power of multiobjects.
- A classification of wait-free loop agreement tasks
- Efficient algorithms for checking the atomicity of a run of read and write operations
- Anonymous and fault-tolerant shared-memory computing
- Efficient adaptive collect algorithms
- An optimistic approach to lock-free FIFO queues
- Failure detectors as type boosters
- Byzantine-tolerant causal broadcast
- A complexity-based classification for multiprocessor synchronization
- Space lower bounds for the signal detection problem
- How many cooks spoil the soup?
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results
- The consensus number of a cryptocurrency
- The assignment problem
- Set-constrained delivery broadcast: a communication abstraction for read/write implementable distributed objects
- Nonblocking \(k\)-compare-single-swap
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring
- Composite registers
- The \(k\)-simultaneous consensus problem
- On the weakest failure detector ever
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing
- Lower and upper bounds for single-scanner snapshot implementations
- Of choices, failures and asynchrony: the many faces of set agreement
- Time and space optimal implementations of atomic multi-writer register
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement
- Long-lived counters with polylogarithmic amortized step complexity
- Generalized symmetry breaking tasks and nondeterminism in concurrent objects
- How Many Cooks Spoil the Soup?
- Asynchronous coordination under preferences and constraints
- The F-Snapshot Problem
- t-resilient immediate snapshot Is impossible
- The time complexity of updating snapshot memories
- A sound and complete proof technique for linearizability of concurrent data structures
- Oblivious Collaboration
- Dynamic atomic snapshots
- Tight bounds for asynchronous renaming
- Progress-space tradeoffs in single-writer memory implementations
- scientific article; zbMATH DE number 7228882 (Why is no real title available?)
- A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition
- The Iterated Restricted Immediate Snapshot Model
- The topology of distributed adversaries
- Help When Needed, But No More: Efficient Read/Write Partial Snapshot
- Power and limits of distributed computing shared memory models
- Time-Lapse Snapshots
- Atomic Snapshots in O (n log n) Operations
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations)
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method
- Transactional scheduling for read-dominated workloads
- Erratum to: ``Limited-use atomic snapshots with polylogarithmic step complexity
- The renaming problem in shared memory systems: an introduction
- Linear space bootstrap communication schemes
- Linear-time snapshot implementations in unbalanced systems
- The collective memory of amnesic processes
- A tight space bound for consensus
- Lattice agreement in message passing systems
- Task computability in unreliable anonymous networks
- Naming symmetric processes using shared variables
- Atomic snapshots using lattice agreement
- Wait-free concurrent memory management by create and read until deletion (CaRuD)
- Randomized two-process wait-free test-and-set
- Hundreds of impossibility results for distributed computing
- Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
- What can be computed in a distributed system?
- F-arrays, implementation and applications
- Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
- An Introduction to the Topological Theory of Distributed Computing with Safe-consensus
- Untangling partial agreement: iterated \(x\)-consensus simulations
- Atomic snapshots from small registers
- Limited-use atomic snapshots with polylogarithmic step complexity
- Wait-freedom with advice
- Wait-free solvability of colorless tasks in anonymous shared-memory model
- Wait-free approximate agreement on graphs
- Towards a practical snapshot algorithm
- The solvability of consensus in iterated models extended with safe-consensus
- Set-linearizable implementations from read/write operations: sets, fetch \& increment, stacks and queues with multiplicity
- Why Extension-Based Proofs Fail
- Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability
- Efficient Bounded Timestamping from Standard Synchronization Primitives
- Byzantine lattice agreement in synchronous message passing systems
- Understanding the set consensus partial order using the Borowsky-Gafni simulation (extended abstract)
- Revisionist simulations: a new approach to proving space lower bounds
- The disagreement power of an adversary
- The complexity of updating snapshot objects
- Help when needed, but no more: efficient read/write partial snapshot
- Iterative computations with ordered read-write locks
- Relaxed queues and stacks from read/write operations
- The computational power of distributed shared-memory models with bounded-size registers
- Inherent limitations on disjoint-access parallel implementations of transactional memory
- Preserving hyperproperties of programs using primitives with consensus number 2
- Brief announcement: Understanding read-write wait-free coverings in the fully-anonymous shared-memory model
This page was built for publication: Atomic snapshots of shared memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4271088)
