Preliminary Evaluation of a Hybrid Deterministic/Adaptive Router

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.

[1]  Annette Guevara Lagman.  Modeling, analysis and evaluation of adaptive routing strategies , 1995 .

[2]  Andrew A. Chien,et al.  J-machine: A fine-grain concurrent computer , 1989 .

[3]  José Duato.  Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[4]  Pedro López,et al.  Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes , 1994, PCRCW.

[5]  William J. Dally.  Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..

[6]  Andrew A. Chien,et al.  A Cost and Speed Model for k-ary n-Cube Wormhole Routers , 1998, IEEE Trans. Parallel Distributed Syst..

[7]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[8]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

[9]  Pedro López,et al.  A high performance router architecture for interconnection networks , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[10]  A. A. Chein,et al.  A cost and speed model for k-ary n-cube wormhole routers , 1998 .

[11]  Andrew A. Chien,et al.  The Cost of Adaptivity and Virtual Lanes in aWormhole Router , 1995 .

[12]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[13]  Sudhakar Yalamanchili,et al.  Architectural support for reducing communication overhead in multiprocessor interconnection networks , 1997, Proceedings Third International Symposium on High-Performance Computer Architecture.

[14]  Luis Gravano,et al.  Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[15]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[16]  Pedro López,et al.  Deadlock- and livelock-free routing protocols for wave switching , 1997, Proceedings 11th International Parallel Processing Symposium.