Time lower bounds for implementations of multi-writer snapshots

Journal of the ACM

Volumn 54, Issue 6, 2007, Pages

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

^a UNIVERSITY OF TORONTO   (Canada)

^b UNIVERSITY OF IOANNINA   (Greece)

^c YORK UNIVERSITY   (Canada)

Author keywords

Distributed computing; Lower bound; Registers; Shared memory; Snapshot; Wait free

Indexed keywords

BRANCH AND BOUND METHOD; NUMBER THEORY; NUMERICAL METHODS; PROBLEM SOLVING; SET THEORY;

COMPONENT SNAPSHOT OBJECTS; LOWER BOUNDS; SHARED MEMORY;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 37049031868     PISSN: 00045411     EISSN: 1557735X     Source Type: Journal    
DOI: 10.1145/1314690.1314694     Document Type: Article

References (32)

1. AFEK, Y., ATTIYA, H., DOLEV, D., GAFNI, E., MERRITT, M., AND SHAVIT, N. 1993. Atomic snapshots of shared memory. J. ACM 40, 4 (Sept.), 873-890.
2. AFEK, Y., BOXER, P., AND TOUITOU, D. 2000. Bounds on the shared memory requirements for long-lived and adaptive objects. In Proceedings of the 19th ACM Symposium on Principles of Distributed Computing. ACM, New York, 81-89.
3. ANDERSON, J. H. 1993. Composite registers. Distrib. Comput. 6, 3 (Apr.), 141-154.
4. ANDERSON, J. H. 1994. Multi-writer composite registers. Distrib. Comput. 7, 4 (May), 175-195.
5. ANDERSON, J. H., AND YANG, J.-H. 1996. Time/contention trade-offs for multiprocessor synchronization. Inf. Comput. 124, 1 (Jan.), 68-84.
6. ASPNES, J. 1993. Time- and space-efficient randomized consensus. J. Algorithans 14, 3 (May), 414-431.
7. ASPNES, J., AND HERLIHY, M. 1990a. Fast, randomized consensus using shared memory. J. Algorithms 11, 2 (Sept.), 441-461.
8. ASPNES, J., AND HERLIHY, M. 1990b. Wait-free data structures in the asynchronous PRAM model. In Proceedings of the 2nd ACM Symposium on Parallel Algorithms and Architectures. ACM, New York, 340-349.
9. ATTIYA, H., ELLEN, F., AND FATOUROU, P. 2006. The complexity of updating multi-writer snapshot objects. In Proceedings of the 8th International Conference on Distributed Computing and Networking. 319-330.
10. ATTIYA, H., FICH, F., AND KAPLAN, Y. 2004. Lower bounds for adaptive collect and related objects. In Proceedings of the 23th ACM Symposium on Principles of Distributed Computing. ACM, New York, 60-69.
11. ATTIYA, H., AND FOUREN, A. 2001. Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput. 31, 2 (Oct.), 642-664.
12. ATTIYA, H., HERLIHY, M., AND RACHMAN, O. 1995. Atomic snapshots using lattice agreement. Distrib. Comput. 8, 3, 121-132.
13. ATTIYA, H., LYNCH, N., AND SHAVIT, N. 1994. Are wait-free algorithms fast? J. ACM 41, 4 (July), 725-763.
14. ATTIYA, H., AND RACHMAN, O. 1998. Atomic snapshots in O(n log n) operations. SIAM J. Comput. 27, 2 (Apr.), 319-340.
15. ATTIYA, H., AND WELCH, J. 2004. Distributed Computing: Fundamentals, Simulations and Advanced Topics, 2nd ed. Wiley, New York.
16. BURNS, J., AND LYNCH, N. 1993. Bounds on shared memory for mutual, exclusion. Inf. Comput. 107, 2 (Dec.), 171-184.
17. FATOUROU, P., FICH, F., AND RUPPERT, E. 2006. Time-space tradeoffs for implementations of snapshots. In Proceedings of the 38th ACM Symposium on Theory of Computing. ACM, New York, 169-178.
18. FICH, F., HERLIHY, M., AND SHAVIT, N. 1998. On the space complexity of randomized synchronization. J. ACM 45, 5 (Sept.), 843-862.
19. FICH, F., AND RUPPERT, E. 2003. Hundreds of impossibility results for distributed computing. Distrib. Comput. 16, 2-3 (Sept.), 121-163.
20. GAWLICK, R., LYNCH, N., AND SHAVIT, N. 1992. Concurrent timestamping made simple. In Proceedings of the Israel Symposium on the Theory of Computing and Systems. Lecture Notes in Computer Science, vol. 601, Springer-Verlag, New York, 171-183.
21. HERLIHY, M. 1991a. Randomized wait-free concurrent objects. In Proceedings of the 10th ACM Symposium on Principles of Distributed Computing. ACM, New York, 11-21.
22. HERLIHY, M. 1991b. Wait-free synchronization. ACM Trans. Program. Lang. Syst. 13, 1 (Jan.), 124-149.
23. HERLIHY, M. P., AND WING, J. M. 1990. Linearizability: A correctness condition for concurrent objects. ACM Trans. Program. Lang. Syst. 12, 3 (July), 463-492.
24. HOEST, G., AND SHAVIT, N. 2006. Towards a topological characterization of asynchronous complexity. SIAM J. Comput. 36, 2, 457-497.
25. INOUE, M., CHEN, W., MASUZAWA, T., AND TOKURA, N. 1994. Linear time snapshots using multi-writer multi-reader registers. In Proceedings of the 8th International Workshop on Distributed Algorithms. Lecture Notes in Computer Science, vol. 857, Springer-Varlag, New York, 130-140.
26. ISRAELI, A., SHAHAM, A., AND SHIRAZI, A. 1995. Linear-time snapshot implementations in unbalanced systems. Math. Syst. Theor. 28, 5 (Sept./Oct.), 469-486.
27. ISRAELI, A., AND SHIRAZI, A. 1998. The time complexity of updating snapshot memories. Inf. Process. Lett. 65, 1 (Jan.), 33-40.
28. JAYANTI, P. 2005. An optimal multi-writer snapshot algorithm. In Proceedings of the 37th ACM Symposium on Theory of Computing. ACM, New York, 723-732.
29. JAYANTI, P., TAN, K., AND TOUEG, S. 2000. Time and space lower bounds for nonblocking implemen-tations. SIAM J. Comput. 30, 2 (June), 438-456.
30. LYNCH, N. A. 1996. Distributed Algorithms. Morgan Kaufmann, San Francisco, CA.
31. RIANY, Y., SHAVIT, N., AND TOUTTOU, D. 2001. Towards a practical snapshot algorithm. Theor. Comput. Sci. 269, 1-2 (Oct.), 163-201.
32. RUPPERT, E. 2000. Deterministic consensus numbers. SIAM J. Comput. 30, 4 (Aug.-Oct.), 1156-1168.