Lower bounds for adaptive collect and related objects

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 60-69

  Attiya, Hagit ^a   Fich, Faith Ellen ^b   Kaplan, Yaniv ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^b UNIVERSITY OF TORONTO   (Canada)

Author keywords

Adaptivity; Collect; Contention; Exclusive write registers; Sensitive objects; Solo termination; Weak test set

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; SYNCHRONIZATION;

COLLECT; CONTENTION; EXCLUSIVE-WRITE REGISTERS; SENSITIVE OBJECTS; SOLO TERMINATION; WEAK TEST & SET;

ADAPTIVE ALGORITHMS;

EID: 10444274940     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011777     Document Type: Conference Paper

References (25)

1. Y. Afek, P. Boxer, and D. Touitou. Bounds on the shared memory requirements for long-lived & adaptive objects (extended abstract). In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 81-89. ACM Press, 2000.
2. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive collect with applications. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 262-272, Phoenix, 1999. IEEE Computer Society Press.
3. Y. Afek, G. Stupp, and D. Touitou. Long-lived and adaptive atomic snapshot and immediate snapshot. In Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pages 71-80, New-York, 2000. ACM Press.
4. M. K. Aguilera, B. Englert, and E. Gafni. Uniform solvability with a finite number of mwmr registers. In Proceedings of the 17th International Conference on Distributed Computing, pages 16-29. Springer-Verlag, 2003.
5. J. Anderson and Y.-J. Kim. Adaptive mutual exclusion with local spinning. In Proceedings of the 14th International Conference on Distributed Computing, Oct. 2000.
6. J. H. Anderson and Y.-J. Kim. An improved lower bound for the time complexity of mutual exclusion. Distributed Computing, 15(4):221-253, 2002.
7. H. Attiya and A. Fouren. Adaptive and efficient algorithms for lattice agreement and renaming. SIAM J. Comput., 31(2):642-664, 2001.
8. H. Attiya and A. Fouren. Algorithms adaptive to point contention. J. ACM, 50(4):444-468, July 2003.
9. H. Attiya, A. Fouren, and E. Gafni. An adaptive collect algorithm with applications. Distributed Computing, 15(2):87-96, 2002.
10. H. Attiya, M. Herlihy, and O. Rachman. Atomic snapshots using lattice agreement. Distributed Computing, 8(3):121-132, 1995.
11. H. Attiya and I. Zach. Fully adaptive algorithms for atomic and immediate snapshots. www.cs.technion.ac.il/~hagit/pubs/AZ03.pdf, Oct. 2003.
12. C. Berge. Graphs and Hypergraphs. North Holland Publishing Company, 1973.
13. J. E. Burns and N. A. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171-184, Dec. 1993.
14. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory systems. J. ACM, 44(6):779-805, Nov. 1997.
15. P. Fatourou, F. Fich, and E. 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. ACM Press, 2003.
16. F. Fich, M. Herlihy, and N. Shavit. On the space complexity of randomized synchronization. J. ACM, 45(5):843-862, Sept. 1998.
17. F. E. Fich. The complexity of computation on the parallel random access machine. In J. Reif, editor, Synthesis of Parallel Algorithms, pages 843-899. Morgan-Kaufmann, 1993.
18. F. E. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16(2-3): 121-163, 2003.
19. D. Hendler and N. Shavit. Operation-valency and the cost of coordination. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, pages 84-91, 2003.
20. M. Herlihy. Wait-free synchronization. ACM Trans. Prog. Lang. Syst., 13(1):124-149, Jan. 1991.
21. M. Herlihy, V. Luchangco, and M. Moir. Obstruction-free synchronization: Double-ended queues as an example. In 23rd International Conference on Distributed Computing Systems, pages 522-529, 2003.
22. M. Herlihy, V. Luchangco, M. Moir, and W. N. S. III. Software transactional memory for dynamic-sized data structures. In Proceedings of the 22nd Annual ACM Symposium on Principles of Distributed Computing, pages 92-101, 2003.
23. P. Jayanti, K. Tan, and S. Toueg. Time and space lower bounds for nonblocking implementations, SIAM J. Comput., 30(2):438-456, 2000.
24. R. M. Karp and V. Ramachandran. Parallel algorithms for shared-memory machines. In Handbook of Theoretical Computer Science, volume Volume A: Algorithms and Complexity, pages 869-942. 1990.
25. M. Moir and J. H. Anderson. Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Programming, 25(1):1-39, Oct. 1995.