Continuous routing and batch routing on the hypercube

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Continuous routing and batch routing on the hypercube

Full text

Pdf (647 KB)

Source

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

Calgary, Alberta, Canada

Pages: 272 - 281

Year of Publication: 1986

ISBN:0-89791-198-9

Authors

Yukon Chang	Department of Computer Science, Pennsylvania State University
Janos Simon	Department of Computer Science, University of Chicago

Sponsor

SIGOPS: ACM Special Interest Group on Operating Systems

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 11, 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/10590.10614 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.

	A	R. Aleliunas, Randomized parallel communication (Preliminary Version), Proceedings of the first ACM SIGACT-SIGOPS symposium on Principles of distributed computing, p.60-72, August 18-20, 1982, Ottawa, Canada [doi>10.1145/800220.806683]
	AKS	M. Ajtai , J. Komlós , E. Szemerédi, An 0(n log n) sorting network, Proceedings of the fifteenth annual ACM symposium on Theory of computing, p.1-9, December 1983 [doi>10.1145/800061.808726]
	AV	D. Angluin and L. G. VMiant, "Fast Probabilistic Algorithm for Hamiltonian Circuits and Matchings", Journal of Computer and System Sciences, Vol. 12 Nr. 6, 1979, pp. 155-193.
	BH	A. Borodin , J. E. Hopcroft, Routing, merging, and sorting on parallel models of computation, Journal of Computer and System Sciences, v.30 n.1, p.130-145, Feb. 1985 [doi>10.1016/0022-0000(85)90008-X]
	C	H. Chernoff, "A measure of asymptotic efficiency for tests of hypothesis based on thesum of observations", Ann. Math. Stat., Vol. 23, 1952, pp. 493-507.
	GP	Zvi Galil , Wolfgang J. Paul, An Efficient General-Purpose Parallel Computer, Journal of the ACM (JACM), v.30 n.2, p.360-387, April 1983 [doi>10.1145/322374.322382]
	H	W. Hoeffding, "On the Distribution of the Number of Successes in Independent Trials", Ann. Math. Star., Vol 27, 1956, pp. 713-721.
	I	INTEL Corporation, iPSC Data Sheet, 1985. Order Number: 280101-001.
	P	N. Pippenger, "Parallel Communication with Limited Buffers", Proceedings of the ggth FOCS, 1984, pp. 127-136.
	R	M.O. Robin, "N-Process Synchronization by 4.1ogN-valued Shared Variable", Proceedings of the Slat FOCS, 1980, pp, 407-410.
	S	Charles L. Seitz, The cosmic cube, Communications of the ACM, v.28 n.1, p.22-33, Jan. 1985 [doi>10.1145/2465.2467]
	Ul	Jeffrey D Ullma, Computational Aspects of VLSI, W. H. Freeman & Co., New York, NY, 1984
	Up1	Eli Upfal, Efficient Schemes for Parallel Communication, Journal of the ACM (JACM), v.31 n.3, p.507-517, July 1984 [doi>10.1145/828.1892]
	Up2	Eli Upfal, A probabilistic relation between desirable and feasible, models of parallel computation, Proceedings of the sixteenth annual ACM symposium on Theory of computing, p.258-265, December 1984 [doi>10.1145/800057.808689]
	VB	L. G. Valiant , G. J. Brebner, Universal schemes for parallel communication, Proceedings of the thirteenth annual ACM symposium on Theory of computing, p.263-277, May 11-13, 1981, Milwaukee, Wisconsin, United States [doi>10.1145/800076.802479]

CITED BY 4

	Mor Harchol-Balter , David Wolfe, Bounding delays in packet-routing networks, Proceedings of the twenty-seventh annual ACM symposium on Theory of computing, p.248-257, May 29-June 01, 1995, Las Vegas, Nevada, United States
	George D. Stamoulis , John N. Tsitsiklis, The efficiency of greedy routing in hypercubes and butterflies, Proceedings of the third annual ACM symposium on Parallel algorithms and architectures, p.248-259, July 21-24, 1991, Hilton Head, South Carolina, United States
	Jop F. Sibeyn, List-ranking on interconnection networks, Information and Computation, v.181 n.2, p.75-87, March 15, 2003
	G. D. Stamoulis , J. N. Tsitsiklis, Efficient Routing Schemes for Multiple Broadcasts in Hypercubes, IEEE Transactions on Parallel and Distributed Systems, v.4 n.7, p.725-739, July 1993