Preliminary Evaluation of a Hybrid Deterministic/Adaptive Router

  • Dianne Miller
  • Walid A. Najjar
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1417)


A novel routing scheme is proposed for virtual cut-through routing that attempts to combine the low routing delay of determinis- tic routing with the exibility and low queuing delays of adaptive rout- ing. This hybrid routing mechanism relies on a pipelined implementation where different paths and stages of the router are used for different rout- ing modes. A simulation based experimental evaluation of these three schemes shows that the hybrid scheme does indeed achieve its objectives.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    K. Aoyama and A. Chien. The cost of adaptivity and virtual lanes in wormhole router. J. of VLSI Design, 2(4), 1995.Google Scholar
  2. 2.
    P. Berman, L. Gravano, G. Pifarre, and J. Sanz. Adaptive deadlock and livelock free routing with all minimal paths in torus networks. In Proc. of the Symp. on Parallel Algorithms and Architectures, pages 3–12, 1992.Google Scholar
  3. 3.
    A. Chien. A cost and speed model for k-ary n-cube wormhole routers. In IEEE Proc. of Hot Interconnects, Aug. 1993.Google Scholar
  4. 4.
    W. Dally, A. Chien, and et al. The J-Machine: a fine-grain concurrent computer. In Proc. of the IFIP Congress, pages 1147–1153, Aug. 1989.Google Scholar
  5. 5.
    W. J. Dally. Virtual-channel ow control. IEEE Trans. on Computers, 3(2):194–205, March 1992.Google Scholar
  6. 6.
    B. Dao, S. Yalamanchili, and J. Duato. Architectural support for reducing communication overhead in multiprocessor interconnection networks. In High Performance Computer Architecture, pages 343–352, 1997.Google Scholar
  7. 7.
    J. Duato. Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm. In Proc. of the 3rd IEEE Symp. on Parallel and Distributed Processing, Dec. 1991.Google Scholar
  8. 8.
    J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. on Parallel and Distributed Systems, 4(12):1320–1331, December 1993.Google Scholar
  9. 9.
    J. Duato and P. Lopez. Performance evaluation of adaptive routing algorithms for k-ary n-cubes. In Parallel Computer Routing and Communication, pages 45–59, 1994.Google Scholar
  10. 10.
    J. Duato, P. Lopez, F. Silva, and S. Yalamanchili. A high performance router architecture for interconnection networks. In Int. Conf. on Parallel Processing, August 1996.Google Scholar
  11. 11.
    J. Duato, P. Lopez, and S. Yalamanchili. Deadlock-and livelock-free routing protocols for wave switching. In Int. Parallel Processing Symp., April 1997.Google Scholar
  12. 12.
    C. L. Glass and L. M. Ni. The turn model for adaptive routing. In Int. Symp. on Computer Architecture, pages 278–287, 1992.Google Scholar
  13. 13.
    P. Kermani and L. Kleinrock. Virtual cut-through: a new computer communication switching technique. Computer Networks, 3:267–286, 1979.MATHMathSciNetGoogle Scholar
  14. 14.
    Annette Lagman. Modelling, Analysis and Evaluation of Adaptive Routing Strategies. PhD thesis, Colorado State University, Computer Science Department, November 1994.Google Scholar
  15. 15.
    L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, pages 62–76, 1993.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1998

Authors and Affiliations

  • Dianne Miller
    • 1
  • Walid A. Najjar
    • 1
  1. 1.Department of Computer ScienceColorado State UniversityFt. CollinsUSA

Personalised recommendations