Time/Contention Trade-Offs for Multiprocessor Synchronization

Information and Computation

Volumn 124, Issue 1, 1996, Pages 68-84

  Anderson, James H ^a   Yang, Jae Heon ^b  

^a Brooks Computer Science Building   (United States)

^b University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (20)

1. R. Alur and G. Taubenfeld, Results about fast mutual exclusion, in "Proceedings of the Thirteenth IEEE Real-Time Systems Symposium, Dec. 1992," pp. 12-21.
2. J. Anderson, A fine-grained solution to the mutual exclusion problem, Acta Inform. 30, No. 3 (1993), 249-265.
3. T. Anderson, The performance of spin lock alternatives for shared-memory multiprocessors, IEEE Trans. Parallel Distrib. Systems 1, No. 1 (Jan. 1990), 6-16.
4. J. Burns and N. Lynch, Bounds on shared memory for mutual exclusion, Inform. and Comput. 107 (1993), 171-184.
5. K. Chandy and J. Misra, How processes learn, Distrib. Comput. 1, No. 1 (1986), 40-52.
6. E. Dijkstra, Solutions of a problem in concurrent programming control. Comm. ACM 8, No. 9 (1965), 569.
7. C. Dwork, M. Herlihy, and O. Waarts, Contention in shared memory algorithms, in "Proceedings of the 25th ACM Symposium on Theory of Computing, May, 1993," pp. 174-183.
8. G. Graunke and S. Thakkar, Synchronization algorithms for shared-memory multiprocessors, IEEE Comput. 23, No. 6 (June 1990), 60-69.
9. M. Herlihy, Wait-free synchronization, ACM Trans. Programming Languages Systems 13, No. 1 (1991), 124-149.
10. M. Herlihy, B.-H. Lim, and N. Shavit, Low contention load balancing on large-scale multiprocessors, in "Proceedings of the 3rd ACM Symposium on Parallel Algorithms and Architectures, July, 1992," pp. 219-227.
11. M. Herlihy, N. Shavit, and O. Waarts, Low contention linearizable counting, in "Proceedings of the 32nd IEEE Symposium on Foundations of Computer Science, Oct. 1991," pp. 526-535.
12. L. Lamport, A fast multual exclusion algorithm, ACM Trans. Comput. Systems 5, No. 1 (Feb. 1987), 1-11.
13. B.-H. Lim and A. Agarwal, Waiting algorithms for synchronization in large-scale multiprocessors, ACM Trans. Comput. Systems 11, No. 3 (Aug. 1993), 253-294.
14. N. Lynch and N. Shavit, Timing-based mutual exclusion, in "Proceedings of the Thirteenth IEEE Real-Time Systems Sympoium, Dec. 1992," pp. 2-11.
15. J. Mellor-Crummey and M. Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Trans. Comput. Systems 9, No. 1 (Feb. 1991), 21-65.
16. M. Merritt and G. Taubenfeld, Knowledge in shared memory systems, in "Proceedings of the Tenth ACM Symposium on Principles of Distributed Computing, Aug. 1991," pp. 189-200.
17. G. Pfister and A. Norton, Hot spot contention and combining in multi-stage Interconnection networks, IEEE Trans. Comput. C-34, No. 11 (Nov. 1985), 943-948.
18. P. Turán, On an extreal problem in graph theory, Mat. Fiz. Lapok 48 (1941), 436-452.
19. J.-H. Yang and J. Anderson, A fast, scalable mutual exclusion algorithm, Distrib. Comput. No. 1 (1995), 51-60.
20. J.-H. Yang and J. Anderson, Time bounds for mutual exclusion and related problems, in "Proceedings of the 26th Annual ACM Symposium on Theory of Computing, May 1994," pp. 224-233.