Robust algorithms for packet routing in a mesh

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Robust algorithms for packet routing in a mesh

Full text

Pdf (628 KB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the first annual ACM symposium on Parallel algorithms and architectures table of contents

Santa Fe, New Mexico, United States

Pages: 344 - 350

Year of Publication: 1989

ISBN:0-89791-323-X

Author

P. Raghavan

IBM Research Division, T.J. Watson Research Center, Yorktown Heights, NY

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 25, Citation Count: 9

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/72935.72972 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	[1] H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Annals of Math. Stat., 23: 493-509, t9o2.
	2	J. Hastad , T. Leighton, Fast computation using faulty hypercubes, Proceedings of the twenty-first annual ACM symposium on Theory of computing, p.251-263, May 14-17, 1989, Seattle, Washington, United States [doi>10.1145/73007.73031]
	3	J. Hastad , T. Leighton , M. Newman, Reconfiguring a hypercube in the presence of faults, Proceedings of the nineteenth annual ACM conference on Theory of computing, p.274-284, January 1987, New York, New York, United States [doi>10.1145/28395.28425]
	4	[4] F. T. Leighton and C. E. Leiserson. A survey of algorithms for integrating wafer-scale systolic arrays. In Wafer Scale Integration, pages 177-195, Elsevier Science Publishers B. V., 1986.
	5	C. D. Thompson , H. T. Kung, Sorting on a mesh-connected parallel computer, Communications of the ACM, v.20 n.4, p.263-271, April 1977 [doi>10.1145/359461.359481]
	6	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 9

	Geng Lin, Fault tolerant planar communication networks, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.133-139, May 04-06, 1992, Victoria, British Columbia, Canada
	Micah Adler , Christian Scheideler, Efficient communication strategies for ad-hoc wireless networks (extended abstract), Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.259-268, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Richard Cole , Bruce Maggs , Ramesh Sitaraman, Multi-scale self-simulation: a technique for reconfiguring arrays with faults, Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, p.561-572, May 16-18, 1993, San Diego, California, United States
	Hisao Tamaki, Construction of the mesh and the torus tolerating a large number of faults, Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures, p.268-277, June 27-29, 1994, Cape May, New Jersey, United States
	Anna R. Karlin , Greg Nelson , Hisao Tamaki, On the fault tolerance of the butterfly, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.125-133, May 23-25, 1994, Montreal, Quebec, Canada
	Thomas R. Mathies, Percolation theory and computing with faulty arrays of processors, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.100-103, September 1992, Orlando, Florida, United States
	Yonatan Aumann , Michael Ben-Or, Computing with faulty arrays, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.162-169, May 04-06, 1992, Victoria, British Columbia, Canada
	Amitabha Bagchi , Ankur Bhargava , Amitabh Chaudhary , David Eppstein , Christian Scheideler, The effect of faults on network expansion, Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, June 27-30, 2004, Barcelona, Spain
	F. Thomson Leighton , Bruce M. Maggs, Fast Algorithms for Routing Around Faults in Multibutterflies and Randomly-Wired Splitter Networks, IEEE Transactions on Computers, v.41 n.5, p.578-587, May 1992