A pattern-associative router for interconnection network adaptive algorithms

  • Daniel G. Rice
  • Jose G. Delgado-Frias
  • Douglas H. Summerville
Workshop 02 Routing and Communication in Interconnection Networks
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1123)


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.

Unable to display preview. Download preview PDF.


  1. [1]
    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.CrossRefGoogle Scholar
  2. [2]
    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.CrossRefGoogle Scholar
  3. [3]
    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
  4. [4]
    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.CrossRefGoogle Scholar
  5. [5]
    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
  6. [6]
    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
  7. [7]
    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
  8. [8]
    J. Van Leeuwen and R.B. Tan, “Interval routing,” The Computer Journal, vol. 30, no. 4, pp. 298–307, 1987.CrossRefGoogle Scholar
  9. [9]
    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.CrossRefGoogle Scholar
  10. [10]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Daniel G. Rice
    • 1
    • 2
  • Jose G. Delgado-Frias
    • 1
  • Douglas H. Summerville
    • 1
  1. 1.Electrical Eng.SUNYBinghamton
  2. 2.Lockheed MartinOwego

Personalised recommendations