A tight time lower bound for space-optimal implementations of multi-writer snapshots

Conference Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2003, Pages 259-268

  Fatourou, Panagiota ^a   Fich, Faith ^b   Ruppert, Eric ^c  

^a UNIVERSITY OF IOANNINA   (Greece)

^b UNIVERSITY OF TORONTO   (Canada)

^c UNIVERSITY OF YORK   (United Kingdom)

Author keywords

Lower bounds; Shared memory distributed computing; Snapshot; Space optimal

Indexed keywords

COMPUTER SCIENCE; DATA STORAGE EQUIPMENT; DATA STRUCTURES;

MULTI-WRITER SNAPSHOTS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 0038446988     PISSN: 07349025     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/780542.780582     Document Type: Conference Paper

References (27)

1. YEHUDA AFEK, HAGIT ATTIYA, DANNY DOLEV, ELI GAFNI, MICHAEL MERRITT, AND NIR SHAVIT. Atomic snapshots of shared memory. Journal of the ACM, 40(4), pages 873-890, September 1993.
2. YEHUDA AFEK, PAZI BOXER, AND DAN TOUITOU. Bounds on the shared memory requirements for long-lived and adaptive objects. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 81-89, 2000.
3. JAMES H. ANDERSON. Composite registers. Distributed Computing, 6(3), pages 141-154, April 1993.
4. JAMES H. ANDERSON. Multi-writer composite registers. Distributed Computing, 7(4), pages 175-195, 1994.
5. JAMES H. ANDERSON AND YONG-JIK KIM. An improved lower bound for the time complexity of mutual exclusion, In Proceedings of the 20th Annual ACM Symposium on Principles of Distributed Computing, pages 90-99, 2001.
6. JAMES H. ANDERSON AND JAE-HEON YANG. Time/contention trade-offs for multiprocessor synchronization. Information and Computation, 124(1), pages 68-84, January 1996.
7. JAMES ASPNES. Time- and space-efficient randomized consensus. Journal of Algorithms, 14(3), pages 414-431, May 1993.
8. JAMES ASPNES AND MAURICE HERLIHY. Fast, randomized consensus using shared memory. Journal of Algorithms, 11(2), pages 441-461, September 1990.
9. JAMES ASPNES AND MAURICE HERLIHY. Wait-free data structures in the asynchronous PRAM model. In Proc. 2nd ACM Symposium on Parallel Algorithms and Architectures, pages 340-349, 1990.
10. HAGIT ATTIYA, ALLA GORBACH, AND SHLOMO MORAN. Computing in totally anonymous asynchronous shared memory systems. In Distributed Computing, 12th International Symposium, volume 1499 of LNCS, pages 49-61, 1998. Full version available from www.cs.technion.ac.il/̃hagit.
11. HAGIT ATTIYA, NANCY LYNCH, AND NIR SHAVIT. Are wait-free algorithms fast? Journal of the ACM, 41(4), pages 725-763, July 1994.
12. HAGIT ATTIYA AND OPHIR RACHMAN. Atomic snapshots in O(n log n) operations, SIAM Journal on Computing, 27(2), pages 319-340, April 1998.
13. HAGIT ATTIYA AND JENNIFER WELCH. Distributed Computing: Fundamentals, Simulations and Advanced Topics. McGraw-Hill, 1998.
14. JAMES BURNS AND NANCY LYNCH. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2), pages 171-184, December 1993.
15. PANAGIOTA FATOUROU, FAITH FICH, AND ERIC RUPPERT. Space-optimal multi-writer snapshot objects are slow. In Proceedings of the 21st ACM Symposium on Principles of Distributed Computing, pages 13-20, 2002.
16. FAITH FICH, MAURICE HERLIHY, AND NIR SHAVIT. On the space complexity of randomized synchronization. Journal of the ACM, 45(5), pages 843-862, September 1998.
17. FAITH FICH AND ERIC RUPPERT. Hundreds of impossibility results for distributed computing. Distributed Computing. To appear.
18. RAINER GAWLICK, NANCY LYNCH, AND NIR SHAVIT. Concurrent timestamping made simple. In Proceedings of the Israel Symposium on the Theory of Computing and Systems, volume 601 of LNCS, pages 171-183, 1992.
19. MAURICE HERLIHY. Randomized wait-free objects. In Proceedings of the 10th Annual ACM Symposium on Principles of Distributed Computing, pages 11-21, 1991.
20. MAURICE HERLIHY. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1), pages 124-149, January 1991.
21. MAURICE P. HERLIHY AND JEANNETTE M. WING. Linearizability: A correctness condition for concurrent objects. ACM Transactions on Programming Languages and Systems, 12(3), pages 463-492, July 1990.
22. MICHIKO INOUE, WEI CHEN, TOSHIMITSU MASUZAWA, AND NOBUKI TOKURA. Linear time snapshots using multi-writer multi-reader registers. In Distributed Algorithms, 8th International Workshop, volume 857 of LNCS, pages 130-140, 1994.
23. A. ISRAELI, A. SHAHAM, AND A. SHIRAZI. Linear-time snapshot implementations in unbalanced systems. Mathematical Systems Theory, 28(5), pages 469-486, September/October 1995.
24. AMOS ISRAELI AND ASAF SHIRAZI. The time complexity of updating snapshot memories. Information Processing Letters, 65(1), pages 33-40, January 1998.
25. PRASAD JAYANTI, KING TAN, AND SAM TOUEG. Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing, 30(2), pages 438-456, 2000.
26. NANCY A. LYNCH. Distributed Algorithms, Morgan Kaufmann, 1996.
27. SHLOMO MORAN, GADI TAUBENFELD, AND IRIT YADIN. Concurrent counting. Journal of Computer and System Sciences, 53(1), pages 61-78, August 1996.