Abstract
In this paper, we propose a high-performance router approach to handle adaptive, deadlock-free, wormhole routing algorithms in a number of interconnection network topologies. The router allows programmable support for a wide range of networks and routing algorithms. Routing algorithms are mapped to a set of bit-patterns which are matched in parallel. The number of bit patterns required depends on the network topology and adaptive routing algorithm; in general this number is of O(network degree). To show the applicability of this adaptive router, we have studied a number of adaptive routing algorithms.
Chapter PDF
Similar content being viewed by others
References
W. Dally and H. Aoki, “Deadlock-free adaptive routing in multicomputer networks using virtual channels,” IEEE Trans. Parallel Dist. Syst., vol. 4, no. 4, Apr. 1993, pp. 466–475.
J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. Parallel Dist. Syst., vol. 4, no. 12, Dec. 1993, pp. 1320–1331.
J. Kim and A. Chien, “An evaluation of planar adaptive routing (PAR)”, Proc. 4th IEEE Symp. Parallel Distrib. Processing, Dec. 1992, pp. 470–478.
D. Linder and J. Harden, “An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes,” IEEE Trans. Comput., vol. 40, no. 1, Jan. 1991, pp. 2–12.
J. Duato, “Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm,” Proc. 3rd IEEE Symp. Parallel Distrib. Processing, 1991, pp. 840–847.
D. Summerville, J. Delgado-Frias and S. Vassiliadis, “A flexible bit-associative router for interconnection networks,” IEEE Trans. Parallel Dist. Syst., vol. 6, no. 5, May 1996.
J. Park, S. Vassiliadis, and J.G. Delgado-Frias, “Flexible oblivious router architecture,” IBM Journal of Research and Development, vol. 39, no. 3, pp. 315–329, May 1995.
J. Van Leeuwen and R.B. Tan, “Interval routing,” The Computer Journal, vol. 30, no. 4, pp. 298–307, 1987.
C.J. Glass and L.M. Ni, “The turn model for adaptive routing,” Journal of the ACM, vol. 41, no. 5, pp. 874–902, Sept. 1994.
D.G. Rice, J.G. Delgado-Frias and D.H. Summerville, “A Pattern-Associate Router for Adaptive Algorithms in Hypercube Networks,” IASTED Int. Conf. Parallel and Dist. Systems, Washington, DC, October, 1995.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Rice, D.G., Delgado-Frias, J.G., Summerville, D.H. (1996). A pattern-associative router for interconnection network adaptive algorithms. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive