Time-space tradeoffs for implementations of snapshots

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 169-178

  Fatourou, Panagipta ^a   Fich, Faith Ellen ^b   Ruppert, Eric ^c  

^a UNIVERSITY OF IOANNINA   (Greece)

^b UNIVERSITY OF TORONTO   (Canada)

^c YORK UNIVERSITY   (Canada)

Author keywords

Anonymous processes; Distributed computing; Lower bound; Shared memory; Snapshot; Time space tradeoff; Wait free

Indexed keywords

ABSTRACTING; COMPUTATION THEORY; COMPUTATIONAL COMPLEXITY; FAULT TOLERANT COMPUTER SYSTEMS; PROBLEM SOLVING; STORAGE ALLOCATION (COMPUTER);

ANONYMOUS PROCESSES; DISTRIBUTED COMPUTING; LOWER BOUND; SHARED MEMORY; SNAPSHOT; TIME-SPACE TRADEOFF; WAIT-FREE;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33748124791     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132542     Document Type: Conference Paper

References (30)

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 AND GIDEON STUPP. Optimal time-space tradeoff for shared memory leader election. Journal of Algorithms, 25(1), pages 95-117, October 1997.
3. RAJEEV ALUR AND GADI TAUBENFELD. Contention-free complexity of shared memory algorithms. Information and Computation, 126(1), pages 62-73, April 1996.
4. JAMES H. ANDERSON. Composite registers. Distributed Computing, 6(3), pages 141-154, April 1993.
5. JAMES H. ANDERSON. Multi-writer composite registers. Distributed Computing, 7(4), pages 175-195, 1994.
6. JAMES ASPNES. Time- and space-efficient randomized consensus. Journal of Algorithms, 14(3), pages 414-431, May 1993.
7. JAMES ASPNES AND MAURICE HERLIHY. Fast, randomized consensus using shared memory. Journal of Algorithms, 11(2), pages 441-461, September 1990.
8. 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.
9. HAGIT ATTIYA, PANAGIOTA FATOUROU, AND FAITH ELLEN FICH. A lower bound on update time for multi-writer snapshot objects. Manuscript, 2004.
10. HAGIT ATTIYA, NANCY LYNCH, AND NIR SHAVIT. Are wait-free algorithms fast? Journal of the ACM, 41(4), pages 725-763, July 1994.
11. HAGIT ATTIYA AND OPHIR RACHMAN. Atomic snapshots in O(n log n) operations. SIAM. Journal on Computing, 27(2), pages 319-340, April 1998.
12. HAGIT ATTIYA AND JENNIFER WELCH. Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd edition. Wiley, 2004.
13. OLIVER BERTHOLD, HANNES FEDERRATH, AND MARIT KÖHNTOPP. Project "anonymity and unobservability in the internet". In Proc. 10th Conference on Computers, Freedom and Privacy, pages 57-65, 2000.
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 Proc. 21st Annual ACM Symposium on Principles of Distributed Computing, pages 13-20, 2002.
16. PANAGIOTA FATOUROU, FAITH FICH, AND ERIC RUPPERT. A tight time lower bound for space-optimal implementations of multi-writer snapshots. In Proceedings of the 35th ACM Symposium on Theory of Computing, pages 259-268, 2003.
17. 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.
18. FAITH FICH AND ERIC RUPPERT. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3), pages 121-163, 2003.
19. MICHAEL J. FISCHER, NANCY A. LYNCH, AND MICHAEL S. PATERSON. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2), pages 374-382, April 1985.
20. 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.
21. RACHID GUERRAOUI AND ERIC RUPPERT. What can be implemented anonymously? In Proc. 19th International Symposium on Distributed Computing, volume 3724 of LNCS, pages 244-259, 2005.
22. DANNY HENDLER AND NIR SHAVIT. Operation-valency and the cost of coordination. In Proc. 22nd Annual ACM Symposium on Principles of Distributed Computing, pages 84-91, 2003.
23. 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.
24. 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.
25. AMOS ISRAELI AND ASAF SHIRAZI. The time complexity of updating snapshot memories. Information Processing Letters, 65(1), pages 33-40, January 1998.
26. 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.
27. GEORGE LUCAS AND JONATHAN HALES. Star Wars: Episode II-Attack of the Clones [motion picture]. Twentieth Century Fox, 2002.
28. NANCY A. LYNCH. Distributed Algorithms. Morgan Kaufmann, 1996.
29. MICHAEL K. REITER AND AVIEL D. RUBIN. Crowds: Anonymity for web transactions. ACM Transactions on Information and System Security, 1(1), pages 66-92, November 1998.
30. ERIC SCHENK. Faster approximate agreement with multi-writer registers. In Proc. 36th Annual Symposium on Foundations of Computer Science, pages 714-723, 1995.