MetaCartSign in to MyCiteSeer

Include Citations | Advanced Search | Help

Include Citations | Advanced Search | Help

  J.Tromp Binary Snapshots (1993) [5 citations — 0 self]

Download:
pdf | ps
by J-h Hoepman, J. Tromp, Jaap-henk Hoepman, John Tromp
In Proc. of the 7th International Workshop on Distributed Algorithms
ftp://ftp.cwi.nl/pub/CWIreports/AA/CS-R9319.ps.Z
Add To MetaCart

Abstract:

This paper considers the shared memory wait-free atomic snapshot object in its simplest form where each cell contains a single bit. We demonstrate the `universality ' of this binary snapshot object by presenting an efficient linear-time implementation of the general multibit atomic snapshot object using an atomic binary snapshot object as a primitive. Thus, the search for an efficient (subquadratic or linear time) wait-free atomic snapshot implementation may be restricted to the binary case.

Citations

118 Atomic Snapshots of Shared Memory – Afek, Attiya, et al.
93 Composite Registers – Anderson - 1990
78 On interprocess communication, Part I: basic formalism – Lamport - 1986
63 Wait-Free Data Structures in the Asynchronous PRAM Model – Aspnes, Herlihy - 1990
37 How to share concurrent wait-free variables – LI, TROMP - 1991
30 Time-Lapse snapshots – Dwork, Herlihy, et al. - 1992
23 Reading many variables in one atomic operation: solutions with linear or sublinear complexity – Kirousis, Spirakis, et al. - 1991
17 Efficient atomic snapshots using lattice agreement – Attiya, Herlihy, et al. - 1992
13 Wait-free test-and-set – Afek, Gafni, et al. - 1992
2 On proving register atomicity – Awerbuch, Kirousis, et al. - 1988
2 Elegant constructions of atomic snapshot variables. Unpublished manuscript – Haldar, Vidyasankar - 1992
1 Amnon Shaham, and Asaf Shirazi. Linear-time snapshot protocols for unbalanced systems – Israeli - 1992