The following pages link to Atomic snapshots of shared memory (Q4271088):
Displaying 50 items.
- The time complexity of updating snapshot memories (Q293175) (← links)
- The topology of distributed adversaries (Q360277) (← links)
- Power and limits of distributed computing shared memory models (Q392187) (← links)
- Virtual world consistency: a condition for STM systems (with a versatile protocol with invisible read operations) (Q442277) (← links)
- Interrupting snapshots and the \(\text{Java}^{\text{TM}}\) size method (Q455960) (← links)
- Transactional scheduling for read-dominated workloads (Q456006) (← links)
- The renaming problem in shared memory systems: an introduction (Q465682) (← links)
- Linear space bootstrap communication schemes (Q477099) (← links)
- The disagreement power of an adversary (Q661056) (← links)
- The complexity of updating snapshot objects (Q663413) (← links)
- Help when needed, but no more: efficient read/write partial snapshot (Q663424) (← links)
- Iterative computations with ordered read-write locks (Q666107) (← links)
- Inherent limitations on disjoint-access parallel implementations of transactional memory (Q693754) (← links)
- An impossibility about failure detectors in the iterated immediate snapshot model (Q975436) (← links)
- From adaptive renaming to set agreement (Q1008730) (← links)
- A criterion for atomicity (Q1192605) (← links)
- Linearizable read/write objects (Q1292436) (← links)
- Can an operation both update the state and return a meaningful value in the asynchronous PRAM model? (Q1603468) (← links)
- Collapsibility of read/write models using discrete Morse theory (Q1616395) (← links)
- Geometric and combinatorial views on asynchronous computability (Q1657197) (← links)
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers (Q1741965) (← links)
- The power of multiobjects. (Q1854306) (← links)
- A classification of wait-free loop agreement tasks (Q1870526) (← links)
- Efficient algorithms for checking the atomicity of a run of read and write operations (Q1892712) (← links)
- Anonymous and fault-tolerant shared-memory computing (Q1954238) (← links)
- Efficient adaptive collect algorithms (Q1954244) (← links)
- An optimistic approach to lock-free FIFO queues (Q1954254) (← links)
- Failure detectors as type boosters (Q1954255) (← links)
- Byzantine-tolerant causal broadcast (Q1981768) (← links)
- A complexity-based classification for multiprocessor synchronization (Q1988522) (← links)
- Space lower bounds for the signal detection problem (Q2048203) (← links)
- How many cooks spoil the soup? (Q2075625) (← links)
- Contention-related crash failures: definitions, agreement algorithms, and impossibility results (Q2078617) (← links)
- The consensus number of a cryptocurrency (Q2121054) (← links)
- The assignment problem (Q2232588) (← links)
- Set-constrained delivery broadcast: a communication abstraction for Read/write implementable distributed objects (Q2232592) (← links)
- Nonblocking \(k\)-compare-single-swap (Q2272205) (← links)
- A lower bound on the number of opinions needed for fault-tolerant decentralized run-time monitoring (Q2304020) (← links)
- Composite registers (Q2365566) (← links)
- The \(k\)-simultaneous consensus problem (Q2377137) (← links)
- On the weakest failure detector ever (Q2377264) (← links)
- From wait-free to arbitrary concurrent solo executions in colorless distributed computing (Q2397607) (← links)
- Lower and upper bounds for single-scanner snapshot implementations (Q2401677) (← links)
- Of choices, failures and asynchrony: the many faces of set agreement (Q2428676) (← links)
- Time and space optimal implementations of atomic multi-writer register (Q2486400) (← links)
- Distributed computability: relating \(k\)-immediate snapshot and \(x\)-set agreement (Q2672233) (← links)
- Store-collect in the presence of continuous churn with application to snapshots and lattice agreement (Q2672251) (← links)
- Long-lived counters with polylogarithmic amortized step complexity (Q2689836) (← links)
- Generalized Symmetry Breaking Tasks and Nondeterminism in Concurrent Objects (Q2802146) (← links)
- How Many Cooks Spoil the Soup? (Q2835012) (← links)
