Atomic snapshots in O(n log n) operations

The atomic snapshot object is an important primitive used for the design and veri- cation of wait-free algorithms in shared-memory distributed systems. A snapshot object is a shared data structure partitioned into segments. Processors can either update an individual segment or instantaneously scan all segments of the object. This paper presents an implementation of an atomic snapshot object in which each high-level operation (scan or update) requires O(n logn) low-level operations on atomic read/write registers.

[1]  Maurice Herlihy,et al.  Wait-free synchronization , 1991, TOPL.

[2]  Nir Shavit,et al.  Bounded concurrrent time-stamp systems are constructible , 1989, STOC '89.

[3]  Amos Israeli,et al.  The Time Complexity of Updating Snapshot Memories , 1994, ESA.

[4]  Amos Israeli,et al.  Linear-Time Snapshot Protocols for Unbalanced Systems , 1993, WDAG.

[5]  Nancy A. Lynch,et al.  Concurrent Timestamping Made Simple , 1992, ISTCS.

[6]  Cynthia Dwork,et al.  Simple and efficient bounded concurrent timestamping or bounded concurrent timestamp systems are comprehensible! , 1992, STOC '92.

[7]  Nir Shavit,et al.  Bounded polynomial randomized consensus , 1989, PODC.

[8]  Hagit Attiya,et al.  Sharing memory robustly in message-passing systems , 1990, PODC '90.

[9]  Maurice Herlihy,et al.  Randomized wait-free concurrent objects (extended abstract) , 1991, PODC '91.

[10]  James H. Anderson,et al.  Composite registers , 1990, PODC '90.

[11]  Maurice Herlihy,et al.  Wait-free data structures in the asynchronous PRAM model , 1990, SPAA '90.

[12]  Maurice Herlihy,et al.  Bounded round number , 1993, PODC '93.

[13]  Maurice Herlihy,et al.  Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract) , 1992, WDAG.

[14]  Nancy A. Lynch,et al.  Are wait-free algorithms fast? , 1994, JACM.

[15]  Nir Shavit,et al.  Atomic snapshots of shared memory , 1990, JACM.

[16]  Maurice Herlihy,et al.  Linearizability: a correctness condition for concurrent objects , 1990, TOPL.

[17]  James Aspnes,et al.  Time-and space-efficient randomized consensus , 1990, PODC '90.

[18]  Paul G. Spirakis,et al.  Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity , 1994, IEEE Trans. Parallel Distributed Syst..

[19]  Wei Chen,et al.  Linear-Time Snapshot Using Multi-writer Multi-reader Registers , 1994, WDAG.

[20]  Paul G. Spirakis,et al.  Reading Many Variables in One Atomic Operation: Solutions With Linear or Sublinear Complexity , 1991, WDAG.

[21]  Maurice Herlihy,et al.  Time-Lapse Snapshots , 1992, SIAM J. Comput..