This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References and Suggested Reading
Felperin, S., P. Raghavan, and E. Upfal, “A Theory of Wormhole Routing in Parallel Computers,” IEEE Trans. Computers, Vol. 45, No. 6, pp. 704–713, June 1996.
Glass, C. J. and L. M. Ni, “The Turn Model for Adaptive Routing,” Proc. 19th Int. Symp. Computer Architecture, 1992, pp. 278–287.
Gu, Q.-P., and J. Gu, “Two Packet Routing Algorithms on a Mesh-Connected Computer,” IEEE Trans. Parallel Distributed Systems, Vol. 6, No. 4, pp. 436–440, April 1995.
Leighton, T., F. Makedon, and I. G. Tollis, “A 2n-2 Step Algorithm for Routing in an n×n Array with Constant Size Queues,” Proc. 1st ACM Symp. Parallel Algorithms and Architectures, 1989, pp. 328–335.
Leighton, F. T., Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes, Morgan Kaufmann, 1992.
McKinley, P. K., Y.-J. Tsai, and D. F. Robinson, “Collective Communication in Wormhole-Routed Massively Parallel Computers,” IEEE Computer, Vol. 28, No. 12, pp. 39–50, December 1995.
Pinkston, T. M., and S. Warnakulasuriya, “On Deadlocks in Interconnection Networks,” Proc. Int. Symp. Computer Architecture, 1997, pp. 38–49.
Rights and permissions
Copyright information
© 2002 Kluwer Academic Publishers
About this chapter
Cite this chapter
(2002). Routing on a 2D Mesh or Torus. In: Introduction to Parallel Processing. Series in Computer Science. Springer, Boston, MA. https://doi.org/10.1007/0-306-46964-2_10
Download citation
DOI: https://doi.org/10.1007/0-306-46964-2_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-306-45970-2
Online ISBN: 978-0-306-46964-0
eBook Packages: Springer Book Archive