A pattern-associative router for interconnection network adaptive algorithms
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.
Unable to display preview. Download preview PDF.
- J. Kim and A. Chien, “An evaluation of planar adaptive routing (PAR)”, Proc. 4th IEEE Symp. Parallel Distrib. Processing, Dec. 1992, pp. 470–478.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar