Searching for "Atomic Snapshots of Shared Memory." – sorted by Relevance.
-
Atomic Snapshots of Shared Memory
- Atomic Snapshots of Shared Memory YEHUDA AFEK Tel-Aviv University, Tel-Aviv, Israel and AT&T Bell
- Cited by 118 (33 self) – Add To MetaCart
-
Round-by-round fault detectors: Unifying synchrony and asynchrony
- implements f resilient Atomic-Snapshot shared-memory is a simple corollary of [4]. Notice
- Cited by 20 (3 self) – Add To MetaCart
-
Wait-free n-set consensus when inputs are restricted
- a finite number of steps. 2.2 Immediate Snapshot Memory Atomic-snapshot shared memory supports a
- Cited by 1 (0 self) – Add To MetaCart
-
Distributed Computing: A Glimmer of a Theory
- memory and atomic-snapshot shared-memory on the other. This instance of model equivalence allowed
- Cited by 1 (0 self) – Add To MetaCart
-
A Note on Set Agreement with Omission Failures
- round-by-round failure detector atomic snapshot shared memory model with at most k crash failures
- Cited by 2 (1 self) – Add To MetaCart
-
Requirements for the Simulation of Distributed Protocols
- . Atomic snapshots of Shared Memory
- Cited by 1 (1 self) – Add To MetaCart
-
Computer-Assisted Verification of an Algorithm for Concurrent Timestamps
- , Lynch, and Shavit (1992), of the original algorithm. It uses atomic snapshots of the shared memory
- Cited by 7 (4 self) – Add To MetaCart
-
Computing in Anonymous Asynchronous Shared Memory
- Styer and Gary L. Peterson. Tight bounds for shared memory symmetric mutual exclusion problems. In Piotr
- Add To MetaCart

