Impossibility and universality results for wait-free synchronization

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	Karl Abrahamson, On achieving consensus using a shared memory, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.291-302, August 15-17, 1988, Toronto, Ontario, Canada [doi>10.1145/62546.62594]
	2	J,H. Anderson and M.G. Gouda. The Virtue of Patience: Concurrent Programming With and Without Waiting. Private Communication.
	3	Bard Bloom, Constructing two-writer atomic registers, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.249-259, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41861]
	4	James E. Burns , Gary L. Peterson, Constructing multi-reader atomic values from non-atomic values, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.222-231, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41859]
	5	Benny Chor , Amos Israeli , Ming Li, On processor coordination using asynchronous hardware, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.86-97, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41848]
	6	Danny Dolev , Cynthia Dwork , Larry Stockmeyer, On the minimal synchronism needed for distributed consensus, Journal of the ACM (JACM), v.34 n.1, p.77-97, Jan. 1987 [doi>10.1145/7531.7533]
	7	Michael J. Fischer , Nancy A. Lynch , Michael S. Paterson, Impossibility of distributed consensus with one faulty process, Journal of the ACM (JACM), v.32 n.2, p.374-382, April 1985 [doi>10.1145/3149.214121]
	8	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]
	9	A. Gottlieb, R. Od.~unan, C.P. Kruskal, K.P. McAuliffe, L. Rudolph, and M. Snir. "The NYU l.Jltracomputer-- Designing an MIMD parallel computer". IEEE Transactions on Computers C-32, 2 ~Feb. 1984), 175-189,
	10	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]
	11	W D Hillis, The connection machine, MIT Press, Cambridge, MA, 1985
	12	Clyde P Kruskal , Larry Rudolph , Marc Snir, Efficient synchronization of multiprocessors with shared memory, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.218-228, August 11-13, 1986, Calgary, Alberta, Canada [doi>10.1145/10590.10609]
	13	Leslie Lamport, Concurrent reading and writing, Communications of the ACM, v.20 n.11, p.806-811, Nov. 1977 [doi>10.1145/359863.359878]
	14	L. Lamport. "Flow to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs". IEEE Transactions on Computer~ C.28, 9 (September 1979), 6.90.
	15	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]
	16	L. Lamport. "On interprocess Communication, Parts I and 1I". Distributed Computing I (1986), 77-101.
	17	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]
	18	M.C. Loui and I4.1-i. Abu-Amara. Memory Requirements for Agreement Among Unreliable Asynchronous Processes. In Advances in Computing Research, JAI Press, 1987, pp. 163-183.
	19	N. A. Lynch , M. Merritt, INTRODUCTION TO THE THEORY OF NESTED TRANSACTIONS, Massachusetts Institute of Technology, Cambridge, MA, 1986
	20	N. A. Lynch , M. Tuttle, HIERARCHICAL CORRECTNESS PROOFS FOR DISTRIBUTED ALGORITHMS, Massachusetts Institute of Technology, Cambridge, MA, 1987
	21	Richard Newman-Wolfe, A protocol for wait-free, atomic, multi-reader shared variables, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.232-248, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41860]
	22	Christos H. Papadimitriou, The serializability of concurrent database updates, Journal of the ACM (JACM), v.26 n.4, p.631-653, Oct. 1979 [doi>10.1145/322154.322158]
	23	Gary L. Peterson, Concurrent Reading While Writing, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.46-55, Jan. 1983 [doi>10.1145/357195.357198]
	24	G.L. Peterson and J.E. Burns. Concurrent reading while writing ii: the multi-writer case. Tech. Rept. GIT-ICS-86/26, Georgia Institute of Technology, Dec.. 1986,
	25	G.H. Pfi~er et al. The IBM re.arch parallel processor prototype (RP3): introduction and architecture, lntematiortal Conference on Pasallel Processing. 1985.
	26	Charles L. Seitz, The cosmic cube, Communications of the ACM, v.28 n.1, p.22-33, Jan. 1985 [doi>10.1145/2465.2467]
	27	Ambuj K. Singh , James H. Anderson , Mohamed G. Gouda, The elusive atomic register revisited, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.206-221, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41858]
	28	H.S. Stone. "Database applications of file FEIL~-AND- ADD instruction". IEEE Transactions on Computers C-33, 7 (July 1984), 604-612.
	29	P. Vitanyi and B. Awerbuch. Atomic Shared Register Access by Asynchronous Hardware. Proceedings of of tile 27th IEEE Symposium on Foundations of Computer Science, 1986, pp. 223-243. See also errata in SIGACT Hews 18(4), Summer. 1987.