Contention-Free Complexity of Shared Memory Algorithms

Information and Computation

Volumn 126, Issue 1, 1996, Pages 62-73

  Alur, Rajeev ^a   Taubenfeld, Gadi ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0012720257     PISSN: 08905401     EISSN: None     Source Type: Journal    
DOI: 10.1006/inco.1996.0034     Document Type: Article

References (16)

1. Afek, Y., and Stupp, G. (1993), Synchronization power depends on the register size, in "Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science," pp. 196-205.
2. Aspnes, J., Herlihy, M., and Shavit, N. (1991), Counting networks and multi-processor coordination, in "Proceedings of the 23rd ACM Symposium on Theory of Computing," pp. 348-358.
3. Alur, R., and Taubenfeld, G. (1992), Results about fast mutual exclusion, in "Proceedings of the 13th IEEE Real-Time Systems Symposium," pp. 12-21.
4. Burns, J., and Lynch, A. (1993), Bounds on shared memory for mutual exclusion, Inform. and Comput. 107, 171-184.
5. Dwork, C., Herlihy, M., and Waarts, O. (1993), Contention in shared memory algorithms, in "Proceedings of the 25th ACM Symposium on Theory of Computing," pp. 174-183.
6. Dijkstra, E. W. (1965), Solution of a problem in concurrent programming control, Comm. ACM 8(9), 569.
7. Fischer, M. J., Moran, S., Rudich, S., and Taubenfeld, G. (1990), The wakeup problem, in "Proceedings of the 22nd ACM Annual Symposium on Theory of Computing," pp. 106-116; to appear in SIAM J. Comp.
8. Fischer, M. J., Moran, S., and Taubenfeld, G. (1993), Space-efficient asynchronous consensus without shared memory initialization, Inform. Process. Lett. 45, 101-105.
9. Herlihy, M. (1991), Wait-free synchronization, ACM Trans. Programming Languages Systems 13(1), 124-149.
10. Kessels, J. L. W. (1982), Arbitration without common modifiable variables, Acta Informat. 17, 135-141.
11. Lamport, L. (1987), A fast mutual exclusion algorithm, ACM Trans. Comput. Systems 5(1), 1-11.
12. Lipton, R. J., and Park, A. (1990), The processor identity problem, Inform. Process. Lett. 36, 91-94.
13. Michael, M. M., and Scott, M. (1993), "Fast Mutual Exclusion, Even with Contention," Technical Report 460, Department of Computer Science, University of Rochester.
14. Peterson, G. L., and Fischer, M. J. (1977), Economical solutions for the critical section problem in a distributed system, in "Proceedings of the 9th ACM Symposium on Theory of Computing," pp. 91-97.
15. Yang, J.-H., and Anderson, J. H. (1993), Fast, scalable synchronization with minimal hardware support, in "Proceedings of the 12th ACM Symposium on Principles of Distributed Computing," pp. 171-182.
16. Yang, J.-H., and Anderson, J. H. (1994), Time bounds for mutual exclusion and related problems, in "Proceedings of the 26th ACM Symposium on Theory of Computing," pp. 224-233.