Optimal fully adaptive wormhole routing for meshes

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Optimal fully adaptive wormhole routing for meshes

Full text

Pdf (941 KB)

Source

Conference on High Performance Networking and Computing archive
Proceedings of the 1993 ACM/IEEE conference on Supercomputing table of contents

Portland, Oregon, United States

Pages: 782 - 791

Year of Publication: 1993

ISBN:0-8186-4340-4

Authors

L. Schwiebert	Department of Computer and Information Science, The Ohio State University, Columbus, Ohio
D. N. Jayasimha	Department of Computer and Information Science, The Ohio State University, Columbus, Ohio

Sponsor

SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 15, Citation Count: 8

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/169627.169835 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	A. A. Chien. A Cost and Speed Model for k-ary n-cube Wormhole Routers. In Hot Interconnects '93, August 1993.
	2	Andrew A. Chien , Jae H. Kim, Planar-adaptive routing: low-cost adaptive networks for multiprocessors, Proceedings of the 19th annual international symposium on Computer architecture, p.268-277, May 19-21, 1992, Queensland, Australia
	3	W. J. Dally, Finite-grain message passing concurrent computers, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.2-12, January 19-20, 1988, Pasadena, California, United States [doi>10.1145/62297.62298]
	4	W. J. Dally, Virtual-Channel Flow Control, IEEE Transactions on Parallel and Distributed Systems, v.3 n.2, p.194-205, March 1992 [doi>10.1109/71.127260]
	5	W. J. Dally , H. Aoki, Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels, IEEE Transactions on Parallel and Distributed Systems, v.4 n.4, p.466-475, April 1993 [doi>10.1109/71.219761]
	6	W. J. Dally , C. L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks, IEEE Transactions on Computers, v.36 n.5, p.547-553, May 1987 [doi>10.1109/TC.1987.1676939]
	7	J. Duato, On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies, Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms, p.390-405, June 1991, Eindhoven, The Netherlands
	8	C. Glass and L. Ni. Maximally Fully Adaptive Routing in 2D Meshes. In International Conference on Parallel Processing, volume I, pages 101-104, 1992.
	9	Christopher J. Glass , Lionel M. Ni, The turn model for adaptive routing, Proceedings of the 19th annual international symposium on Computer architecture, p.278-287, May 19-21, 1992, Queensland, Australia
	10	C. R. Jesshope , P. R. Miller , J. T. Yantchev, High performance communications in processor networks, Proceedings of the 16th annual international symposium on Computer architecture, p.150-157, April 1989, Jerusalem, Israel
	11	Daniel H. Linder , Jim C. Harden, An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes, IEEE Transactions on Computers, v.40 n.1, p.2-12, January 1991 [doi>10.1109/12.67315]
	12	L. Schwiebertand D. N. Jayasimha. Optimal Fully Adaptive Wormhole Routing for Meshes. Technical Report OSU- CISRC-4/93-TR 16, The Ohio State University, 1993.

CITED BY 8

	Swaminathan Ramany , Derek Eager, The interaction between virtual channel flow control and adaptive routing in wormhole networks, Proceedings of the 8th international conference on Supercomputing, p.136-145, July 11-15, 1994, Manchester, England
	Loren Schwiebert, Deadlock-free oblivious wormhole routing with cyclic dependencies, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.149-158, June 23-25, 1997, Newport, Rhode Island, United States
	Loren Schwiebert , D. N. Jayasimha, A universal proof technique for deadlock-free routing in interconnection networks, Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures, p.175-184, June 24-26, 1995, Santa Barbara, California, United States
	D. N. Jayasimha , Loren Schwiebert , D. Manivannan , Jeff A. May, A foundation for designing deadlock-free routing algorithms in wormhole networks, Journal of the ACM (JACM), v.50 n.2, p.250-275, March 2003
	Rajendra V. Boppana , Suresh Chalasani, A Framework for Designing Deadlock-Free Wormhole Routing Algorithms, IEEE Transactions on Parallel and Distributed Systems, v.7 n.2, p.169-183, February 1996
	Loren Schwiebert, Deadlock-Free Oblivious Wormhole Routing with Cyclic Dependencies, IEEE Transactions on Computers, v.50 n.9, p.865-876, September 2001
	Suresh Chalasani , Rajendra V. Boppana, Adaptive Multimodule Routers for Multiprocessor Architectures, Information Systems Frontiers, v.7 n.3, p.317-327, July 2005
	Vassos Soteriou , Li-Shiuan Peh, Exploring the Design Space of Self-Regulating Power-Aware On/Off Interconnection Networks, IEEE Transactions on Parallel and Distributed Systems, v.18 n.3, p.393-408, March 2007