How hard is it to take a snapshot

The snapshot object is an important and well-studied primitive in distributed computing. This paper will present some implementations of snapshots from registers, in both asycnhronous and synchronous systems, and discuss known lower bounds on the time and space complexity of this problem.

[1]  James H. Anderson,et al.  Multi-writer composite registers , 1994, Distributed Computing.

[2]  Hagit Attiya,et al.  Atomic Snapshots in O(n log n) Operations , 1998, SIAM J. Comput..

[3]  Danny Dolev,et al.  Theory of Computing and Systems , 1992, Lecture Notes in Computer Science.

[4]  Maurice Herlihy,et al.  Fast Randomized Consensus Using Shared Memory , 1990, J. Algorithms.

[5]  Amos Israeli,et al.  The Time Complexity of Updating Snapshot Memories , 1994, Inf. Process. Lett..

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

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

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

[9]  Faith Ellen,et al.  Efficient synchronous snapshots , 2004, PODC '04.

[10]  Hagit Attiya,et al.  An adaptive collect algorithm with applications , 2002, Distributed Computing.

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

[12]  Prasad Jayanti.  f-arrays: implementation and applications , 2002, PODC '02.

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

[14]  Gil Neiger,et al.  Space-Efficient Atomic Snapshots in Synchronous Systems , 1993 .

[15]  Ophir Rachman,et al.  Atomic snapshots using lattice agreement , 1995, Distributed Computing.

[16]  Sam Toueg,et al.  Time and Space Lower Bounds for Nonblocking Implementations , 2000, SIAM J. Comput..

[17]  Amos Israeli,et al.  Linear-time snapshot implementations in unbalanced systems , 1995, Mathematical systems theory.

[18]  Amos Israeli,et al.  Bounded time-stamps , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

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

[20]  Nancy A. Lynch,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

[21]  Faith Ellen,et al.  Space-optimal multi-writer snapshot objects are slow , 2002, PODC '02.

[22]  Faith Ellen,et al.  A tight time lower bound for space-optimal implementations of multi-writer snapshots , 2003, STOC '03.

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

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

[25]  James Aspnes.  Time- and Space-Efficient Randomized Consensus , 1993, J. Algorithms.