Operation-Valency and the Cost of Coordination

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn 22, Issue , 2003, Pages 84-91

  Hendler, Danny ^a   Shavit, Nir ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Algorithms Theory

Indexed keywords

APPROXIMATION THEORY; BUFFER STORAGE; COMPUTATIONAL COMPLEXITY; DATA STORAGE EQUIPMENT; MULTIPROCESSING SYSTEMS; QUEUEING THEORY; THEOREM PROVING;

HASH TABLES; READ-MODIFY-WRITE (RMW) OPERATIONS; SHARED MEMORY MULTIPROCESSORS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 1142281025     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/872035.872047     Document Type: Conference Paper

References (16)

1. Anderson and Yang. Time/contention trade-offs for multiprocessor synchronization. INFCTRL: Information and Computation (formerly Information and Control), 124, 1996.
2. J. Anderson and Y. Kim. An improved lower bound for the time complexity of mutual exclusion, 2001.
3. C. Busch, N. Hardavellas, and M. Mavronicolas. Contention in counting networks. In Symposium on Principles of Distributed Computing, page 404, 1994.
4. C. Busch and M. Mavronicolas. An efficient counting network. In Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS/SPDP'98), pages 380-385, 1998.
5. B. Chor, A. Israeli, and M. Li. On processor coordination using asynchronous hardware. In Proceedings of the 6th ACM Symposium on Principles of Distributed Computing (PODC), pages 86-97, New York, NY, 1987. ACM Press.
6. R. Cypher. The communication requirements of mutual exclusion. In ACM Proceedings of the Seventh Annual Symposium on Parallel Algorithms and Architectures, pages 147-156, 1995.
7. C. Dwork, M. Herlihy, and O. Waarts. Contention in shared memory algorithms. Journal of the ACM (JACM), 44(6):779-805, 1997.
8. F. E. Fich and E. Ruppert. Lower bounds in distributed computing. In International Symposium on Distributed Computing, pages 1-28, 2000.
9. M. J. Fischer, N. A. Lynch, and M. S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374-382, April 1985.
10. M. Herlihy. Wait-free synchronization. ACM Transactions On Programming Languages and Systems, 13(1):123-149, Jan. 1991.
11. M. Herlihy. Wait-free synchronization. ACM Transactions on Programming Languages and Systems, 13(1):124-149, January 1991.
12. M. Herlihy, N. Shavit, and O. Waarts. Linearizable counting networks. Distributed Computing, 9(4):193-203, April 1996.
13. 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.
14. M. C. Loui and H. H. Abu-Amara. Memory requirements for agreement among unreliable asynchronous processes. Advances in Computing Research, 4:163-183, 1987.
15. N. Lynch. A hundred impossibility proofs for distributed computing. In Proceedings of the 8th ACM Symposium on Principles of Distributed Computing (PODC), pages 1-28, New York, NY, 1989. ACM Press.
16. M. Merrit and G. Taubenfeld. Knowledge in shared memory systems. In ACM Symp. on Principles of Distributed Computing, pages 189-200, 1991.