Atomic snapshots of shared memory
From MaRDI portal
Publication:4271088
DOI10.1145/153724.153741zbMath0783.68029OpenAlexW1993805917WikidataQ64216181 ScholiaQ64216181MaRDI QIDQ4271088
Danny Dolev, Eli Gafni, Michael Merritt, Hagit Attiya, Nir Shavit, Yehuda Afek
Publication date: 20 March 1994
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/153724.153741
snapshotsynchronizationfault-toleranceconcurrencyshared memorymultiprogrammingmultiprocessingprocess managementmultiple-data-stream processorsmultiple-instruction-stream
Related Items
The consensus number of a cryptocurrency, Collapsibility of read/write models using discrete Morse theory, Composite registers, The time complexity of updating snapshot memories, The \(k\)-simultaneous consensus problem, On the weakest failure detector ever, Efficient algorithms for checking the atomicity of a run of read and write operations, Unnamed Item, Tight Bounds for Asynchronous Renaming, Geometric and combinatorial views on asynchronous computability, From wait-free to arbitrary concurrent solo executions in colorless distributed computing, The topology of distributed adversaries, Lower and upper bounds for single-scanner snapshot implementations, Progress-Space Tradeoffs in Single-Writer Memory Implementations, The space complexity of long-lived and one-shot timestamp implementations, A Sound and Complete Proof Technique for Linearizability of Concurrent Data Structures, 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, Power and limits of distributed computing shared memory models, Linear-time snapshot implementations in unbalanced systems, 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, The Iterated Restricted Immediate Snapshot Model, Of choices, failures and asynchrony: the many faces of set agreement, Long-lived counters with polylogarithmic amortized step complexity, Asynchronous Wait-Free Runtime Verification and Enforcement of Linearizability, Efficient Bounded Timestamping from Standard Synchronization Primitives, Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read 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, Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method, Transactional scheduling for read-dominated workloads, The renaming problem in shared memory systems: an introduction, Naming symmetric processes using shared variables, Atomic snapshots using lattice agreement, 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, Linear space bootstrap communication schemes, 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, The assignment problem, Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects, Byzantine-tolerant causal broadcast, Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers, A criterion for atomicity, A complexity-based classification for multiprocessor synchronization, Inherent limitations on disjoint-access parallel implementations of transactional memory, What Can be Computed in a Distributed System?, Time and space optimal implementations of atomic multi-writer register, An Introduction to the Topological Theory of Distributed Computing with Safe-consensus, An impossibility about failure detectors in the iterated immediate snapshot model, Nonblocking \(k\)-compare-single-swap, Unnamed Item, Unnamed Item, Towards a practical snapshot algorithm, Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects, Untangling Partial Agreement: Iterated x-consensus Simulations, Wait-freedom with advice, Wait-free solvability of colorless tasks in anonymous shared-memory model, From adaptive renaming to set agreement, Space lower bounds for the signal detection problem, Wait-free approximate agreement on graphs, A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring, Oblivious Collaboration, How Many Cooks Spoil the Soup?, Asynchronous Coordination Under Preferences and Constraints, The F-Snapshot Problem, t-Resilient Immediate Snapshot Is Impossible, A Versatile STM Protocol with Invisible Read Operations That Satisfies the Virtual World Consistency Condition, How many cooks spoil the soup?, Contention-related crash failures: definitions, agreement algorithms, and impossibility results, Linearizable read/write objects, A Tight Space Bound for Consensus, Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity, The power of multiobjects., Can an operation both update the state and return a meaningful value in the asynchronous PRAM model?, A classification of wait-free loop agreement tasks
