On the inherent weakness of conditional synchronization primitives

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 23, Issue , 2004, Pages 80-87

  Fich, Faith ^a   Hendler, Danny ^b   Shavit, Nir ^b  

^a UNIVERSITY OF TORONTO   (Canada)

^b TEL AVIV UNIVERSITY   (Israel)

Author keywords

Compare and Swap; Load Linked; Lower bounds; Store Conditional; Synchronization primitives; Test and Set; Wait freedom

Indexed keywords

COMPUTER SCIENCE; MULTIPROCESSING SYSTEMS; STORAGE ALLOCATION (COMPUTER); SYNCHRONIZATION;

COMPARE-AND-SWAP; LOAD-LINKED; LOWER BOUNDS; STORE-CONDITIONAL; SYNCHRONIZATION PRIMITIVES; TEST-AND-SET; WAIT-FREEDOM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 10444256196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1011767.1011780     Document Type: Conference Paper

References (11)

1. J. Anderson and Y. Kim. An improved lower bound for the time complexity of mutual exclusion. In ACM Symposium on Principles of Distributed Computing, pages 90-99, 2001.
2. J. Anderson and Y. Kim. Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing, 16(2-3):75-l 10, 2003.
3. J. Burns and N. Lynch. Bounds on shared memory for mutual exclusion. Information and Computation, 107(2):171-184, December 1993.
4. R. Cypher. The communication requirements of mutual exclusion. In A CM Proceedings of the Seventh Annual Symposium on Parallel Algorithms and Architectures, pages 147-156, 1995.
5. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. Journal of the ACM (JACM), 44(6):779-805, 1997.
6. F. E. Fich and E. Ruppert. Hundreds of impossibility results for distributed computing. Distributed Computing, 16:121-163, 2003.
7. M. Herlihy. Wait-free synchronization. ACM Transactions On Programming Languages and Systems, 13(1):123-149, Jan. 1991.
8. M. P. Herlihy and J. M. Wing. Linearizability: A correctness condition for concurrent objects. ACM Transactions On Programming Languages and Systems, 12(3):463-492, July 1990.
9. P. Jayanti. A time complexity lower bound for randomized implementations of some shared objects. In Symposium on Principles of Distributed Computing, pages 201-210, 1998.
10. P. Jayanti, K. Tan, and S. Toueg. Time and space lower bounds for non-blocking implementations. In Symposium on Principles of Distributed Computing, pages 257-266, 1996.
11. M. Merrit and G. Taubenfeld. Knowledge in shared memory systems. In ACM Symp. on Principles of Distributed Computing, pages 189-200, 1991.