The turn model for adaptive routing

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The turn model for adaptive routing

Full text

Pdf (1.08 MB)

Source

International Symposium on Computer Architecture archive
25 years of the international symposia on Computer architecture (selected papers) table of contents

Barcelona, Spain

Pages: 441 - 450

Year of Publication: 1998

ISBN:1-58113-058-9

Authors

Christopher J. Glass	Advanced Computer Systems Laboratory, Department of Computer Science, Michigan State University, East Lansing, MI
Lionel M. Ni	Advanced Computer Systems Laboratory, Department of Computer Science, Michigan State University, East Lansing, MI

Sponsors

IEEE-CS\TCCA : TC on Computer Arhitecture
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 15, Downloads (12 Months): 39, Citation Count: 1

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/285930.286003 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	NCUBE Company, NCUBE 6~00 Processor Manlai, 1990.
	2	intei Corporation, A Tottchatone DELTA System Description, 1991.
	3	S. Borkar , R. Cohn , G. Cox , S. Gleason , T. Gross, Warp: an integrated solution of high-speed parallel computing, Proceedings of the 1988 ACM/IEEE conference on Supercomputing, p.330-339, November 12-17, 1988, Orlando, Florida, United States
	4	Daniel Lenoski , James Laudon , Kourosh Gharachorloo , Anoop Gupta , John Hennessy, The directory-based cache coherence protocol for the DASH multiprocessor, Proceedings of the 17th annual international symposium on Computer Architecture, p.148-159, May 28-31, 1990, Seattle, Washington, United States
	5	Anant Agarwal , Beng-Hong Lim , David Kranz , John Kubiatowicz, APRIL: a processor architecture for multiprocessing, Proceedings of the 17th annual international symposium on Computer Architecture, p.104-114, May 28-31, 1990, Seattle, Washington, United States
	6	W.J. Dally and C. L. Seitz, "The torero routing chip," Jowrvtal
	7	P. Kermani and L. Kleinmck, "Virtual cut-through: A new computer conunurucation switching technique," Compttter Networts, vol. 3, no. 4, pp. 267-286, 1979.
	8	William J. Dally, Performance Analysis of k-ary n-cube Interconnection Networks, IEEE Transactions on Computers, v.39 n.6, p.775-785, June 1990 [doi>10.1109/12.53599]
	9	Xiaola Lin , Lionel M. Ni, Deadlock-free multicast wormhole routing in multicomputer networks, Proceedings of the 18th annual international symposium on Computer architecture, p.116-125, May 27-30, 1991, Toronto, Ontario, Canada
	10	C. L. Seitz , W. C. Athas , C. M. Flaig , A. J. Martin , J. Seizovic , C. S. Steele , W-K. Su, The architecture and programming of the Ametek series 2010 multicomputer, Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues, p.33-37, January 19-20, 1988, Pasadena, California, United States [doi>10.1145/62297.62302]
	11	W. J. Dally, "The J-machine: System support for Actors," in Actors: Knowledge.Based Concurrent Computing (Hewitt and Agha, eds.), MIT Press, 1989.
	12	W. J. Dally and H. Aoki, "Adaptive routing using virtual channels," tech. rep., Massachusetts Institute of Technology, Laboratory for Computer Science, Sept. 1990.
	13	Herbert Sullivan , T R Bashkow, A large scale, homogeneous, fully distributed parallel machine, I, Proceedings of the 4th annual symposium on Computer architecture, p.105-117, March 23-25, 1977
	14	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]
	15	J. T. Yantchev and C. R. Jesshope, "Adaptive, low latency, deadlock-free packet routing for networks of processors," in lEE Proceedings, Pt. E, vol. 136(3), pp. 178-186, May 1988.
	16	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]
	17	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]
	18	C. J. Glass and L. M. Ni, "Maximally fully adaptive routing in 2d meshes," Tech. Rep. MSU-CPS-ACS-51, Dept. of Computer Science, Michigan State University, East Lansing, Michigan, Jan. 1992.
	19	C. J. Glass and L. M. Ni, "Adaptive routing in meshconnected networks," in Proceedings of the l~th International Conference on DiJtributed Comp~ting SyJtem,, June 1992.
	20	Smaragda Konstantinidou, Adaptive, minimal routing in hypercubes, Proceedings of the sixth MIT conference on Advanced research in VLSI, p.139-153, March 1990, Boston, Massachusetts, United States