Simple, fast, and practical non-blocking and blocking concurrent queue algorithms

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	T. E. Anderson, The Performance of Spin Lock Alternatives for Shared-Money Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, v.1 n.1, p.6-16, January 1990 [doi>10.1109/71.80120]
	2	Greg Barnes, A method for implementing lock-free shared-data structures, Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures, p.261-270, June 30-July 02, 1993, Velen, Germany [doi>10.1145/165231.165265]
	3	Allan Gottlieb , Boris D. Lubachevsky , Larry Rudolph, Basic Techniques for the Efficient Coordination of Very Large Numbers of Cooperating Sequential Processors, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.2, p.164-189, April 1983 [doi>10.1145/69624.357206]
	4	M. P. Herlihy , J. M. Wing, Axioms for concurrent objects, Proceedings of the 14th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.13-26, January 21-23, 1987, Munich, West Germany [doi>10.1145/41625.41627]
	5	Maurice P. Herlihy , Jeannette M. Wing, Linearizability: a correctness condition for concurrent objects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.3, p.463-492, July 1990 [doi>10.1145/78969.78972]
	6	Maurice Herlihy, A methodology for implementing highly concurrent data objects, ACM Transactions on Programming Languages and Systems (TOPLAS), v.15 n.5, p.745-770, Nov. 1993 [doi>10.1145/161468.161469]
	7	Kai Hwang , Faye A. Briggs, Computer Architecture and Parallel Processing, McGraw-Hill, Inc., New York, NY, 1990
	8	Leonidas Kontothanassis , Robert W. Wisniewski, Using scheduler information to achieve optimal barrier synchronization performance, Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.64-72, May 19-22, 1993, San Diego, California, United States
	9	Leslie Lamport, Specifying Concurrent Program Modules, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.2, p.190-222, April 1983 [doi>10.1145/69624.357207]
	10	H. Massalin and C. Pu. A Lock-Free Multiprocessot OS Kernel. Technical Report CUCS-005-91, Computer Science Department, Columbia University, 1991.
	11	J.M. Mellor-Crummey. Concurrent Queues: Practical Fetch-and-~ Algorithms. TR 229, Computer Science Department, University of Rochester, November 1987.
	12	John M. Mellor-Crummey , Michael L. Scott, Algorithms for scalable synchronization on shared-memory multiprocessors, ACM Transactions on Computer Systems (TOCS), v.9 n.1, p.21-65, Feb. 1991 [doi>10.1145/103727.103729]
	13	Maged M. Michael , Michael L. Scott, Correction of a Memory Management Method for Lock-Free Data Structures, University of Rochester, Rochester, NY, 1995
	14	S. Prakash, Y. H. Lee, and T. Johnson. A Non-Blocking Algorithm for Shared Queues Using Compare-and_Swap. In Proceedings of the 1991 International Conference on Parallel Processing, pages 1I:68-75, 1991.
	15	S. Prakash, Y. H. Lee, and T. Johnson. Non-Blocking Algorithms for Concurrent Data Structures. Technical Report 91-002, University of Horida, 1991.
	16	S. Prakash , Yann Hang Lee , T. Johnson, A Nonblocking Algorithm for Shared Queues Using Compare-and-Swap, IEEE Transactions on Computers, v.43 n.5, p.548-559, May 1994 [doi>10.1109/12.280802]
	17	R. Sites. Operating Systems and Computer Architecture. In H. Stone, editor, Introduction to Computer Architecture, 2nd edition, Chapter 12, 1980. Science Research Associates.
	18	Janice M. Stone, A simple and correct shared-queue algorithm using compare-and-swap, Proceedings of the 1990 conference on Supercomputing, p.495-504, October 1990, New York, New York, United States
	19	J.M. Stone. A Non-Blocking Compare-and-Swap Algorithm for a Shared Circular Queue. In S. Tzafesms et al., editors, Parallel and Distributed Computing in Engineering Systems, pages 147-152, 1992. Elsevier Science Publishers.
	20	Harold S. Stone, High-performance computer architecture (2nd ed.), Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1990
	21	R.K. Treiber. Systems Programming: Coping with Parallelism. In RJ 5118, IBM Almaden Research Center, April 1986.
	22	John Turek , Dennis Shasha , Sundeep Prakash, Locking without blocking: making lock based concurrent data structure algorithms nonblocking, Proceedings of the eleventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.212-222, June 02-05, 1992, San Diego, California, United States [doi>10.1145/137097.137873]
	23	J.D. Valois. Implementing Lock-Free Queues. In Seventh International Conference on Parallel and Distributed Computing Systems, Las Vegas, N'V, October 1994.
	24	John David Valois, Lock-free data structures, Rensselaer Polytechnic Institute, Troy, NY, 1996
	25	Robert W. Wisniewski , Leonidas I. Kontothanassis , Michael L. Scott, Scalable Spin Locks for Multiprogrammed Systems, Proceedings of the 8th International Symposium on Parallel Processing, p.583-589, April 01, 1994
	26	Robert W. Wisniewski , Leonidas I. Kontothanassis , Michael L. Scott, High performance synchronization algorithms for multiprogrammed multiprocessors, Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming, p.199-206, July 19-21, 1995, Santa Barbara, California, United States