The intractability of bounded protocols for non-FIFO channels

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The intractability of bounded protocols for non-FIFO channels

Full text

Pdf (1.31 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: 59 - 72

Year of Publication: 1989

ISBN:0-89791-326-4

Authors

Y. Mansour	Laboratory for Computer Science, Massachusetts Institute of Technology, 545 Technology Square, Cambridge, MA
B. Schieber	IBM Research Division, T.J. Watson Reeearch Ceuter, P.0. Box 218, Yorktown Heights, NY

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): 1, Downloads (12 Months): 8, Citation Count: 3

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.72985 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.

	Afe88	Y. Afek. 1988. Personal com_mnniction.
	AFWZ88	H. Attiya, M.J. Fischer, D. Waztg, and L.D. Zuck. Reliable comnmnlcation using unrel;able channels. 1988. Manuscript.
	BSW69	K. A. Bartlett , R. A. Scantlebury , P. T. Wilkinson, A note on reliable full-duplex transmission over half-duplex links, Communications of the ACM, v.12 n.5, p.260-261, May 1969 [doi>10.1145/362946.362970]
	Hoe63	W. Hoeffdiag. Probability inequalities for sums of bounded random v~riables. Journal o~ the Araerican S~a6s~ical As. sociafion, 58(301):13--30, 1963.
	LMF88	Nancy A. Lynch , Yishay Mansour , Alan Fekete, Data link layer: two impossibility results, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.149-170, August 15-17, 1988, Toronto, Ontario, Canada [doi>10.1145/62546.62572]
	LT87	Nancy A. Lynch , Mark R. Tuttle, Hierarchical correctness proofs for distributed algorithms, Proceedings of the sixth annual ACM Symposium on Principles of distributed computing, p.137-151, August 10-12, 1987, Vancouver, British Columbia, Canada [doi>10.1145/41840.41852]
	Tan81	Andrew S. Tanenbaum, Computer Networks, Prentice Hall PTR, Upper Saddle River, NJ, 1985
	WZ89	Da-Wei Wang , L. D. Zuck, Tight bounds for the sequence transmission problem, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.73-83, June 1989, Edmonton, Alberta, Canada [doi>10.1145/72981.72986]

CITED BY 3

	O. Goldreich , A. Herzberg , Y. Mansour, Source to destination communication in the presence of faults, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, p.85-101, June 1989, Edmonton, Alberta, Canada
	Ewan Tempero , Richard Ladner, Tight bounds for weakly bounded protocols, Proceedings of the ninth annual ACM symposium on Principles of distributed computing, p.205-218, August 22-24, 1990, Quebec City, Quebec, Canada
	Da-Wei Wang , Lenore Zuck, Real-time sequence transmission problem, Proceedings of the tenth annual ACM symposium on Principles of distributed computing, p.111-123, August 19-21, 1991, Montreal, Quebec, Canada