The ambiguity of choosing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The ambiguity of choosing

Full text

Pdf (1.36 MB)

Source

Annual ACM Symposium on Principles of Distributed Computing archive
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing table of contents

Edmonton, Alberta, Canada

Pages: 145 - 157

Year of Publication: 1989

ISBN:0-89791-326-4

Authors

J. E. Burns	School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia
G. L. Peterson	School of Information and Computer Science, Georgia Institute of Technology, Atlanta, Georgia

Sponsors

SIGOPS: ACM Special Interest Group on Operating Systems
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 0, Downloads (12 Months): 14, Citation Count: 19

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/72981.72991 What is a DOI?

REFERENCES

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.

	ADMS89	Yehuda Afek, Danny Dolev, Michael Merritt, and Nit Shavit. (Private communication.)
	ABDKPR	Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, and Rfidiger Reischuk. Achievable cases in an asynchronous environment. 28th Syrup. on Foundations of Computer Science, Los Angeles, CA, Oct. 1987, pp. 337-346.
	AT89	Hagit Attiya and Mark Tuttle. (Private communincation.)
	B87	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]
	BP87a	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]
	BP87b	James E. Burns and Gary L. Peterson. Pure buffers for concurrent reading while writing. Georgia Institute of Technology, School of information and Computer Science, GIT-ICS-87/17, Apr. 1987.
	CHP71	P. J. Courtois , F. Heymans , D. L. Parnas, Concurrent control with “readers” and “writers”, Communications of the ACM, v.14 n.10, p.667-668, Oct. 1971 [doi>10.1145/362759.362813]
	DDS87	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]
	DGS88	Danny Dolev , Eli Gafni , Nir Shavit, Toward a non-atomic era: l-exclusion as a test case, Proceedings of the twentieth annual ACM symposium on Theory of computing, p.78-92, May 02-04, 1988, Chicago, Illinois, United States [doi>10.1145/62212.62220]
	DS89	D. Dolev , N. Shavit, Bounded concurrrent time-stamp systems are constructible, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.454-466, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73051]
	FLBB79	Michael j. Fischer, Nancy A. Lynch, James E. Burns, and Allan Borodin. Resource allocation with immunity to limited process failure. 20th Syrup. on Foundations of Computer Science, San Juan, Puerto Rico, Oct. 1979, pp. 234-254.
	FLBB89	Michael J. Fischer , Nancy A. Lynch , James E. Burns , Allan Borodin, Distributed FIFO allocation of identical resources using small shared space, ACM Transactions on Programming Languages and Systems (TOPLAS), v.11 n.1, p.90-114, Jan. 1989 [doi>10.1145/59287.59292]
	FLP85	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]
	L77	Leslie Lamport, Concurrent reading and writing, Communications of the ACM, v.20 n.11, p.806-811, Nov. 1977 [doi>10.1145/359863.359878]
	LAA87	Michael C. Loui and Hosame H. Abu- Amara. Memory requirements for agreement among unreliable asynchronous processes. In Advances in Computing Research 4 (19s ) x63-1 .
	N-W87	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]
	P81	Gary L. Peterson. Myths about the mutual exclusion problem. Information Processing Letter, 12, 3 (June 1981), 115-116.
	P83a	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]
	P83b	Gary L. Peterson, A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables, ACM Transactions on Programming Languages and Systems (TOPLAS), v.5 n.1, p.56-65, Jan. 1983 [doi>10.1145/357195.357199]
	PB86	Gary L. Peterson and James E. Burns. Concurrent reading while writing II: The multi-writer case. Proceedings 28th IEEE Symposium on Foundations of Computer Science, Los Angeles, CA, Oct. 1987, pp. 383-392.
	S88	Russel $chaffer. On the correctness of atomic multi-writer registers. Bachelor's Thesis, Lab. for Computer Science, MIT (June 1988).
	SAG87	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]

CITED BY 19

	Hagit Attiya , Amotz Bar-Noy , Danny Dolev, Sharing memory robustly in message-passing systems, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.363-375, August 22-24, 1990, Quebec City, Quebec, Canada
	Yehuda Afek , Michael Merritt, Fast, wait-free (2k-1)-renaming, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.105-112, May 04-06, 1999, Atlanta, Georgia, United States
	M. Herlihy , Mark R. Tuttle, Lower bounds for wait-free computation in message-passing systems, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.347-362, August 22-24, 1990, Quebec City, Quebec, Canada
	Hagit Attiya , Vita Bortnikov, Adaptive and efficient mutual exclusion (extended abstract), Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing, p.91-100, July 16-19, 2000, Portland, Oregon, United States
	Yehuda Afek , Hagit Attiya , Arie Fouren , Gideon Stupp , Dan Touitou, Long-lived renaming made adaptive, Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, p.91-103, May 04-06, 1999, Atlanta, Georgia, United States
	Mark Moir , Juan A. Garay, Fast, long-lived renaming improved and simplified, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.152, May 23-26, 1996, Philadelphia, Pennsylvania, United States
	Hagit Attiya , Amotz Bar-Noy , Danny Dolev, Sharing memory robustly in message-passing systems, Journal of the ACM (JACM), v.42 n.1, p.124-142, Jan. 1995
	S. Haldar , K. Vidyasankar, Space-efficient construction of buffer-optimal 1-writer 1-reader multivalued atomic variable, Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing, p.178, May 23-26, 1996, Philadelphia, Pennsylvania, United States
	Hagit Attiya , Arie Fouren, Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract), Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, p.277-286, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Hagit Attiya , Vita Bortnikov, Adaptive and efficient mutual exclusion, Distributed Computing, v.15 n.3, p.177-189, July 2002
	Faith Fich , Eric Ruppert, Hundreds of impossibility results for distributed computing, Distributed Computing, v.16 n.2-3, p.121-163, September 2003
	Hagit Attiya , Arie Fouren , Eli Gafni, An adaptive collect algorithm with applications, Distributed Computing, v.15 n.2, p.87-96, April 2002
	Maurice Herlihy, Impossibility results for asynchronous PRAM (extended abstract), Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.327-336, July 21-24, 1991, Hilton Head, South Carolina, United States
	James H. Anderson , Mark Moir, Using local-spin k-exclusion algorithms to improve wait-free object implementations, Distributed Computing, v.11 n.1, p.1-20, December 1997
	Yehuda Afek , Gideon Stupp , Dan Touitou, Long lived adaptive splitter and applications, Distributed Computing, v.15 n.2, p.67-86, April 2002
	Michel Raynal , Gadi Taubenfeld, The notion of a timed register and its application to indulgent synchronization, Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures, June 09-11, 2007, San Diego, California, USA
	Bogdan S. Chlebus , Dariusz R. Kowalski, Asynchronous exclusive selection, Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing, August 18-21, 2008, Toronto, Canada
	Sibsankar Haldar , K. Vidyasankar, On space-optimality of buffer-based conflict-free constructions of 1-writer 1-reader multivalued atomic variables from safe bits, Journal of Parallel and Distributed Computing, v.69 n.1, p.20-27, January, 2009
	Stephen E. Paynter , Neil Henderson , James M. Armstrong, Metastability in Asynchronous Wait-Free Protocols, IEEE Transactions on Computers, v.55 n.3, p.292-303, March 2006