Disjoint-access-parallel implementations of strong shared memory primitives

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.

	AF92	Juan Alemany , Edward W. Felten, Performance issues in non-blocking synchronization on shared-memory multiprocessors, Proceedings of the eleventh annual ACM symposium on Principles of distributed computing, p.125-134, August 10-12, 1992, Vancouver, British Columbia, Canada [doi>10.1145/135419.135446]
	Alpha	DEC, Alpha system reference manual.
	AW91	Richard J. Anderson , Heather Woll, Wait-free parallel algorithms for the union-find problem, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.370-380, May 05-08, 1991, New Orleans, Louisiana, United States [doi>10.1145/103418.103458]
	AWW93	Yehuda Afek , Eytan Weisberger , Hanan Weisman, A completeness theorem for a class of synchronization objects, Proceedings of the twelfth annual ACM symposium on Principles of distributed computing, p.159-170, August 15-18, 1993, Ithaca, New York, United States [doi>10.1145/164051.164071]
	Bar93	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]
	Her88	Maurice P. Herlihy, Impossibility and universality results for wait-free synchronization, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.276-290, August 15-17, 1988, Toronto, Ontario, Canada [doi>10.1145/62546.62593]
	Her91	M. P. Herlihy. A methodology for implementing highly concurrent data structures. DEC Cambridge Research Lab Technical report 91/10.
	HM92	M. P. Herlihy, J. E. B. Moss. Transactional Memory: Architectural Support for Lock- Free Data Structures. DEC Cambridge Re~ search Lab Technical report 92/7.
	HW90	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]
	IBM	IBM System 370 principles of operation. Order Number GA22-7000.
	IR93	Amos Israeli , Lihu Rappoport, Efficient Wait-Free Implementation of a Concurrent Priority Queue, Proceedings of the 7th International Workshop on Distributed Algorithms, p.1-17, September 27-29, 1993
	LS88	Vladimir Lanin , Dennis Shasha, Concurrent set manipulation without locking, Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.211-220, March 1988, Austin, Texas, United States [doi>10.1145/308386.308442]
	Kan89	G. Kane. MIP$ RI$C Archztecture, Prentice Hall, New York, 1989.
	Mot84	CORPORATE MOTOROLA, MC68020 32-BIT microprocessor user's manual, Motorola Inc., Phoenix, AZ, 1991
	Pl89	S. A. Plotkin, Sticky bits and universality of consensus, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.159-175, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72992]
	PLJ91	S. Prakash, Y. Lee and T. Johnson. A Non- Blocking Algorithm for Shared Queues Using Compare-and-Swap, Proceedings 1991 International Conference on Parallel Processzng, volume 2, pages 68-75.
	ST94	N. Shavit and D. Touitou. Software Transactional Memory. Technical Report 290/94, Tel-Aviv University.
	TSP92	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]