Nonblocking Algorithms and Preemption-Safe Locking on Multiprogrammed Shared Memory Multiprocessors

Journal of Parallel and Distributed Computing

Volumn 51, Issue 1, 1998, Pages 1-26

  Michael, Maged M ^a   Scott, Michael L ^a  

^a University of Rochester   (United States)

Author keywords

Nonblocking; lock free; mutual exclusion; locks; multiprogramming; concurrent queues; concurrent stacks; concurrent heaps; concurrent counters; concurrent date structures; compare and swap ; load linked ; store conditional .

Indexed keywords

EID: 0002477257     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1998.1446     Document Type: Article

References (42)

1. Alemany J., Felten E. W. Performance issues in non-blocking synchronization on shared-memory multiprocessors. Proceedings of the Eleventh ACM Symposium on Principles of Distributed Computing. August 1992;. p. 125-134.
2. Anderson J. H., Moir M. Universal constructions for multi-object operations. Proceedings of the Fourteenth ACM Symposium on Principles of Distributed Computing. August 1995;. p. 184-194.
3. Anderson T. E. The performance of spin lock alternatives for shared-memory multiprocessors. IEEE Trans. Parallel Distrib. Syst. 1:January 1990;6-16.
4. Anderson T. E., Bershad B. N., Lazowska E. D., Levy H. M. Scheduler activations: Effective kernel support for the user-level management of parallelism. ACM Trans. Comput. Syst. 10:February 1992;53-79.
5. Barnes G. A method for implementing lock-free data structures. Proceedings of the Fifth Annual ACM Symposium on Parallel Algorithms and Architectures. June-July 1993;. p. 261-270.
6. Black D. L. Scheduling support for concurrency and parallelism in the mach operating system. Computer. 23:May 1990;35-43.
7. Edler J., Lipkis J., Schonberg E. Process management for highly parallel UNIX systems. Proceedings of the USENIX Workshop on Unix and Supercomputers. September 1988.
8. Gottlieb A., Lubachevsky B. D., Rudolph L. Basic techniques for the efficient coordination of very large numbers of cooperating sequential processors. ACM Trans. Progrmg. Lang. Syst. 5:April 1983;164-189.
9. Herlihy M. P. Wait-free synchronization. ACM Trans. Progrmg. Lang. Syst. 13:January 1991;124-149.
10. Herlihy M. P. A methodology for implementing highly concurrent data objects. ACM Trans. Progrmg. Lang. Syst. 15:November 1993;745-770.
11. Herlihy M. P., Moss J. E. Transactional memory: Architectural support for lock-free data structures. Proceedings of the Twentieth International Symposium on Computer Architecture. May 1993;. p. 289-300.
12. Herlihy M. P., Wing J. M. Axioms for concurrent object. Proceedings of the 14th ACM Symposium on Principles of Programming Languages. January 1987;. p. 13-26.
13. Herlihy M. P., Wing J. M. Linearizability: A correctness condition for concurrent objects. ACM Trans. Progrmg. Lang. Syst. 12:July 1990;463-492.
14. Hwang K., Briggs F. A. Computer Architecture and Parallel Processing. 1984.
15. Jensen E. H., Hagensen G. W., Broughton J. M. A new approach to exclusive data access in shared memory multiprocessors. Technical Report. November 1987.
16. Karlin A. R., Li K., Manasse M. S., Owicki S. S. Empirical studies of competitive spinning for a shared-memory multiprocessor. Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles. October 1991;. p. 41-55.
17. Kontothanassis L. I., Wisniewski R. W., Scott M. L. Scheduler-conscious synchronization. ACM Trans. Comput. Syst. 15:February 1997.
18. Krieger O., Stumm M., Unrau R. C. A fair fast scalable reader-writer lock. Proceedings of the 1993 International Conference on Parallel Processing. August 1993;. p. II: 201-204.
19. LaMarca A. A performance evaluation of lock-free synchronization protocols. Proceedings of the Thirteenth ACM Symposium on Principles of Distributed Computing. August 1994;. p. 130-140.
20. Lamport L. Specifying concurrent program modulus. ACM Trans. Progrmg. Lang. Syst. 5:April 1983;190-222.
21. Marsh B. D., Scott M. L., LeBlanc T. J., Markatos E. P. First-class user-level threads. Proceedings of the Thirteenth ACM Symposium on Operating Systems Principles. October 1991;. p. 110-121.
22. Massalin H., Pu C. A lock-free multiprocessor OS kernel. Technical report. 1991.
23. Mellor-Crummey J. M. Concurrent queues: Practical fetch-and-Φ TR. November 1987.
24. Mellor-Crummey J. M., Scott M. L. Algorithms for scalable synchronization on shared-memory multiprocessors. ACM Trans. Comput. Syst. 9:February 1991;21-65.
25. M. M. Michael, M. L. Scott, Implementation of atomic primitives on distributed shared-memory multiprocessors, Proceedings of the First International Symposium on High Performance Computer Architecture, Raleigh, NC, January 1995, 222, 231.
26. Michael M. M., Scott M. L. Correction of a memory management method for lock-free data structures. Technical Report. December 1995.
27. Michael M. M., Scott M. L. Simple, fast, and practical non-blocking and blocking concurrent queue algorithms. Proceedings of the Fifteenth ACM Symposium on Principles of Distributed Computing. May 1996;. p. 267-275.
28. Michael M. M., Scott M. L. Relative performance of preemption-safe locking and non-blocking synchronization on multiprogrammed shared memory multiprocessors. Proceedings of the Eleventh International Parallel Processing Symposium. April 1997.
29. Ousterhout J. K. Scheduling techniques for concurrent systems. Proceedings of the Third International Conference on Distributed Computing Systems. October 1982;. p. 22-30.
30. Prakash S., Lee Y. H., Johnson T. Non-blocking algorithms for concurrent data structures. Technical Report. July 1991.
31. Prakash S., Lee Y. H., Johnson T. A nonblocking algorithm for shared queues using compare-and-swap. IEEE Trans. Comput. 43:May 1994;548-559.
32. Shavit N., Touitou D. Transactional memory. Proceedings of the Fourteenth ACM Symposium on Principles of Distributed Computing. August 1995;. p. 204-213.
33. Sites R. Operating systems and computer architecture. Introduction to Computer Architecture. 1980;Science Research Associates, Chicago.
34. Stone H. S. High Performance Computer Architecture. 1993;Addison-Wesley, Reading.
35. Stone J. M. A simple and correct shard-queue algorithm using compare-and-swap. Proceedings of Supercomputing '90. November 1990;. p. 495-504.
36. Stone J. M. A non-blocking compare-and-swap algorithm for a shared circular queue. Tzafestas S. Parallel and Distributed Computing in Engineering Systems. 1992;147-152 Elsevier Science, Amsterdam/New York.
37. Stone J. M., Stone H. S., Heidelberger P., Turek J. Multiple reservations and the Oklahoma update. IEEE Parallel Distrib. Tech. 1:November 1993;58-71.
38. Treiber R. K. Systems programming: Coping with parallelism. RJ 5118, Almaden Research Center. April 1986.
39. Turek J., Shasha D., Prakash S. Locking without blocking: Making lock based concurrent data structure algorithms nonblocking. Proceedings of the 11th ACM Symposium on Principles of Database Systems. August 1992;. p. 212-222.
40. Valois J. D. Implementing lock-free queues. Proceedings of the Seventh International Conference on Parallel and Distributed Computing Systems. October 1994;. p. 64-69.
41. Valois J. D. Lock-free linked lists using compare-and-swap. Proceedings of the Fourteenth ACM Symposium on Principles of Distributed Computing. August 1995;. p. 214-222.
42. Zahorjan J., Lazowska E. D., Eager D. L. The effect of scheduling discipline on spin overhead in shared memory parallel systems. IEEE Trans. Parallel Distrib. Syst. 2:April 1991;180-198.