Distributed match-making for processes in computer networks (preliminary version)

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Distributed match-making for processes in computer networks (preliminary version)

Full text

Pdf (961 KB)

Source

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

Minaki, Ontario, Canada

Pages: 261 - 271

Year of Publication: 1985

ISBN:0-89791-168-7

Authors

Sape J. Mullender	CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands
Paul M. B. Vitányi	CWI, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands

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): 4, Downloads (12 Months): 15, Citation Count: 4

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/323596.323620 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.

	1	George Broomell , J. Robert Heath, Classification Categories and Historical Development of Circuit Switching Topologies, ACM Computing Surveys (CSUR), v.15 n.2, p.95-133, June 1983 [doi>10.1145/356909.356912]
	2	Yogen Kantilal Dalal, Broadcast protocols in packet switched computer networks., 1977
	3	Yogen K. Dalal , Robert M. Metcalfe, Reverse path forwarding of broadcast packets, Communications of the ACM, v.21 n.12, p.1040-1048, Dec. 1978 [doi>10.1145/359657.359665]
	4	Erd/Ss, P., L. Ger~ncser, and A. Mat6, "Problems of graph theory concerning optimal design," pp. 317-325 in Colloquium Math. Soc. Janos Bolyai 4, ed. P. Erdrs, V.T. S6s, North-Holland Publishing Company, Amsterdam (1970).
	5	David Gelernter , Arthur J. Bernstein, Distributed communication via global buffer, Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.10-18, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806676]
	6	Barbara Liskov , Stephen Zilles, Programming with abstract data types, Proceedings of the ACM SIGPLAN symposium on Very high level languages, p.50-59, March 28-29, 1974, Santa Monica, California, United States
	7	Needham, R. M. and A. J. Herbert, The Cambridge Distributed Computer System. Addison-Wesley, 1982.
	8	Charles L. Seitz, The cosmic cube, Communications of the ACM, v.28 n.1, p.22-33, Jan. 1985 [doi>10.1145/2465.2467]
	9	Sloane, NJ.A., A Handbook of Integer Sequences. New York:Academic Press, 1973.
	10	Andrew S. Tanenbaum , Sape J. Mullender, An overview of the Amoeba distributed operating system, ACM SIGOPS Operating Systems Review, v.15 n.3, p.51-64, July 1981 [doi>10.1145/1041500.1041502]
	11	Tanenbaum, A. S. and SJ. Mullender, "The design of a capability-based distributed operating system," Computer Journal, to appear.
	12	Valiant, L.G., "A scheme for fast parallel communication," SIAMJ. on Computing, vol. 11, pp.350-361, 1982.

CITED BY 4

	Brian M. Oki , Barbara H. Liskov, Viewstamped replication: a general primary copy, Proceedings of the seventh annual ACM Symposium on Principles of distributed computing, p.8-17, August 15-17, 1988, Toronto, Ontario, Canada
	Robert Joseph Fowler, The complexity of using forwarding addresses for decentralized object finding, Proceedings of the fifth annual ACM symposium on Principles of distributed computing, p.108-120, August 11-13, 1986, Calgary, Alberta, Canada
	Sape Mullender, Making Amoeba work, Proceedings of the 2nd workshop on Making distributed systems work, p.1-3, September 08-10, 1986, Amsterdam, Netherlands
	P. F. Tsuchiya, The landmark hierarchy: a new hierarchy for routing in very large networks, ACM SIGCOMM Computer Communication Review, v.18 n.4, p.35-42, August 1988