Time and space lower bounds for nonblocking implementations

SIAM Journal on Computing

Volumn 30, Issue 2, 2000, Pages 438-456

  Jayanti, Prasad ^a   Tan, King ^a   Toueg, Sam ^b  

^a DARTMOUTH COLLEGE   (United States)

^b Department of Computer Science and School of Operations Research and Information Engineering   (United States)

Author keywords

Asynchronous shared memory algorithms; Lower bounds; Nonblocking; Randomized shared object implementations; Space complexity; Synchronization; Time complexity; Wait free

Indexed keywords

ALGORITHMS; BOUNDARY VALUE PROBLEMS; DATA STORAGE EQUIPMENT; MATHEMATICAL MODELS; RANDOM PROCESSES; SYNCHRONIZATION; TIME AND MOTION STUDY;

ASYNCHRONOUS SHARED MEMORY; TIME AND SPACE LOWER BOUNDS;

COMPUTATIONAL COMPLEXITY;

EID: 0342468144     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797317299     Document Type: Article

References (14)

1. Y. AFEK, H. ATTIYA, D. DOLEV, E. GAFNI, M. MERRITT, AND N. SHAVIT, Atomic snapshots of shared memory, J. Assoc. Comput. Mach., 40 (1993), pp. 873-890.
2. J. ANDERSON, Composite registers, Distrib. Comput., 6 (1993), pp. 141-154.
3. J. ASPNES, Time and space efficient randomized consensus, in Proceedings of the Ninth ACM Symposium on Principles of Distributed Computing, Quebec City, Canada, 1990, pp. 325-332.
4. Y. AUMANN, Efficient asynchronous consensus with the weak adversary scheduler, in Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, 1997, pp. 209-218.
5. J. E. BURNS AND N. A. LYNCH, Bounds on shared memory for mutual exclusion, Inform. and Comput., 107 (1993), pp. 171-184.
6. T. D. CHANDRA, Polylog randomized wait-free consensus, in Proceedings of the 15th Annual ACM Symposium on Principles of Distributed Computing, Philadelphia, PA, 1996, pp. 166-175.
7. T. D. CHANDRA, P. JAYANTI, AND K. Y. TAN, A polylog time wait-free construction for closed objects, in Proceedings of the 17th Annual ACM Symposium on Principles of Distributed Computing, Puerto Vallarta, Mexico, 1998, pp. 287-296.
8. F. FICH, M. HERLIHY, AND N. SHAVIT, On the space complexity of randomized synchronization, in Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, Ithaca, NY, 1993, pp. 241-249.
9. F. FICH, M. HERLIHY, AND N. SHAVIT, On the space complexity of randomized synchronization, J. Assoc. Comput. Mach., 45 (1998), pp. 843-862.
10. M. P. HERLIHY, Impossibility and universality results for wait-free synchronization, in Proceedings of the Seventh ACM Symposium on Principles of Distributed Computing, Toronto, Canada, 1988, pp. 276-290.
11. M. P. HERLIHY, Wait-free synchronization, ACM Transactions on Programming Languages and Systems, 13 (1991), pp. 124-149.
12. M. P. HERLIHY AND N. SHAVIT, The asynchronous computability theorem for t-resilient tasks, in Proceedings of the 25th ACM Symposium on Theory of Computing, San Diego, CA, 1993, pp. 111-120.
13. M. P. HERLIHY AND J. M. WING, Linearizability: A correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems, 12 (1990), pp. 463-492.
14. S. PLOTKIN, Sticky bits and universality of consensus, in Proceedings of the Eighth ACM Symposium on Principles of Distributed Computing, Edmonton, Canada, 1989, pp. 159-175.