The complexity of updating multi-writer snapshot objects

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4308 LNCS, Issue , 2006, Pages 319-330

  Attiya, Hagit ^a   Ellen, Faith ^b   Fatourou, Panagiota ^c  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF IOANNINA   (Greece)

Author keywords

[No Author keywords available]

Indexed keywords

LOWER BOUNDS; SPECIFIC COMPONENT; STEP COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

COMPUTER SCIENCE;

EID: 84885217311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11947950_35     Document Type: Conference Paper

References (21)

1. Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, and Nir Shavit, Atomic snapshots of shared memory, JACM, Vol. 40, no. 4, September 1993, pages 873-890.
2. James H. Anderson, Multi-writer composite registers, Distributed Computing, Vol. 7, no. 4, May 1994, pages 175-195.
3. Hagit Attiya and Arie Fouren, Adaptive and efficient algorithms for lattice agreement and renaming, SICOMP, Vol. 31, no. 2, October 2001, pages 642-664.
4. Hagit Attiya and Ophir Rachman, Atomic snapshots in O(n log n) operations, SICOMP, Vol. 27, no. 2, April 1998, pages 319-340.
5. Hagit Attiya and Jennifer Welch, Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edition, Wiley-Interscience, 2004.
6. Panagiota Fatourou, Faith Ellen Fich, and Eric Ruppert. A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots, STOC 2003, pages 259-268.
7. Panagiota Fatourou, Faith Ellen Fich, and Eric Ruppert. A Tight Time Lower Bound for Space-Optimal Implementations of Multi-Writer Snapshots, manuscript, 2006.
8. Panagiota Fatourou and Nikolaos Kallimanis, Single-Scanner Multi-Writer Snapshot Implementations are Fast, PODC 2006, pages 228-237.
9. Faith Ellen Fich, How Hard is it to Take a Snapshot?, SOFSEM 2005, LNCS, Vol. 3381, pages 27-35.
10. Faith Fich, Maurice Herlihy, and Nir Shavit, On the Space Complexity of Randomized Synchronization, JACM, Vol. 45, no. 5, September 1998, pages 843-862.
11. Faith Ellen Fich and Eric Ruppert, Hundreds of Impossibility Results for Distributed Computing, Distributed Computing, Vol. 16, no. 2-3, 2003, pages 121-163.
12. Maurice P. Herlihy and Jeannette M. Wing, Linearizability: A correctness condition for concurrent objects, TOPLAS, Vol. 12, no. 3, July 1990, pages 463-492.
13. Michiko Inoue, Wei Chen, Toshimitsu Masuzawa, and Nobuki Tokura, Linear time snapshots using multi-writer multi-reader registers, WDAG 1994, LNCS, Vol. 857, pages 130-140.
14. A. Israeli, A. Shaham, and A. Shirazi, Linear-time snapshot implementations in unbalanced systems, Mathematical Systems Theory, Vol. 28, no. 5, September/October 1995, pages 469-486.
15. Amos Israeli and Assaf Shirazi, The time complexity of updating snapshot memories, Information Processing Letters, Vol. 65, no. 1, 1998, pages 33-40.
16. Prasad Jayanti, f-Arrays: Implementation and Applications, PODC 2002, pages 270-279.
17. Prasad Jayanti, An Optimal Multi-Writer Snapshot Algorithm, STOC 2005, pages 723-732.
18. Prasad Jayanti, King Tan, and Sam Toueg, Time and space lower bounds for non-blocking implementations, SICOMP, Vol. 30, no. 2, June 2000, pages 438-456.
19. L.M. Kirousis, P. Spirakis, and P. Tsigas, Reading Many Variables in One Atomic Operation: Solutions with Linear or Sublinear Complexity, IEEE Trans. on Parallel and Distributed Systems, Vol. 5, no. 7, July 1994, pages 688-696.
20. Nancy Lynch, Distributed Algorithms, Morgan Kaufmann, 1996.
21. Yaron Riany, Nir Shavit, and Dan Touitou, Towards a Practical Snapshot Algorithm, Theoretical Computer Science, Vol. 269, 2001, pages 163-201.