MetaCart Sign in to MyCiteSeerX

Documents
Authors
Tables !

Searching for "Snapshots in Shared Memory." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

22 documents found, showing 1 through 10. Next 10 →

ATOM

Atomic Snapshots of Shared Memory
by Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt — 1993
…Atomic Snapshots of Shared Memory YEHUDA AFEK Tel-Aviv University, Tel-Aviv, Israel and AT&T Bell…
Cited by 120 (34 self) – Add To MetaCart

The BG Distributed Simulation Algorithm
by Elizabeth Borowsky, Eli Gafni, Nancy Lynch, Sergio Rajsbaum, Ciudad Universitaria — 1997 — Distributed Computing
… Projects. 1 Introduction Consider an asynchronous snapshot shared memory system. We describe an algorithm…
Cited by 27 (8 self) – Add To MetaCart

Binary Snapshots
by J-h Hoepman, John Tromp, Jaap-henk Hoepman, John Tromp — 1993 — In Proc. of the 7th International Workshop on Distributed Algorithms
… This paper considers the shared memory wait-free atomic snapshot object in its simplest form where each cell…
Cited by 5 (0 self) – Add To MetaCart

A Note on the Homotopy Type of Wait-free Atomic Snapshot Protocol Complexes
by John Havlicek — 1998
… is assumed, without loss of generality [Af+], to provide atomic snapshot reads for accessing shared memory…
Cited by 1 (1 self) – Add To MetaCart

Understanding the Set Consensus Partial Order Using the Borowsky-Gafni Simulation (Extended Abstract)
by Soma Chaudhuri, Paul Reiners — 1996 — In Distributed Algorithms, 10th International Workshop, volume 1151 of LNCS
…-input action be given a fair turn. We assume an asynchronous shared memory system with snapshot variables…
Cited by 10 (0 self) – Add To MetaCart

Wait-free n-set consensus when inputs are restricted
by Zvi Avidor — 2002 — In Proceedings of the thirty-third Annual ACM symposium on Distributed Computing, Lecture Notes in Computer Science
…. In Section 2.2, we restrict the computational model by defining the immediate snapshot shared memory model…
Cited by 1 (0 self) – Add To MetaCart

On the Borowsky-Gafni Simulation Algorithm (Extended Abstract)
by Nancy Lynch, Sergio Rajsbaum — 1996 — In Proceedings of the FourthIsraeli Symposium on Theory of Computing and Systems
… system using snapshot shared memory can be "implemented" in terms of single-writer multi-reader read…
Cited by 2 (0 self) – Add To MetaCart

Round-by-round fault detectors: Unifying synchrony and asynchrony
by Eli Gafni — 1998 — In Proc of the 17th ACM Symp. Principles of Distributed Computing (PODC
… implements f resilient Atomic-Snapshot shared-memory is a simple corollary of [4]. Notice…
Cited by 20 (3 self) – Add To MetaCart

From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement
by Eli Gafni — 2005 — In Proceedings of the 37 th ACM Symposium on Theory of Computing (STOC’05
…] (the snapshot operation may be implemented from read and write operations in asynchronous shared memory…
Cited by 2 (2 self) – Add To MetaCart

The Unified Structure of Consensus: a Layered Analysis Approach
by Yoram Moses, Sergio Rajsbaum — 1998 — In 17th ACM Symposium on Principles of Distributed Computing (PODC
… such simulations have been given, e.g. between shared memory and message passing [3]; between snapshot shared…
Cited by 9 (3 self) – Add To MetaCart

Showing 1 through 10. Next 10 →

ATOM

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB