Hierarchical adaptive routing: a framework for fully adaptive and deadlock-free wormhole routing

Adaptive routing can improve network performance and fault-tolerance by providing multiple routing paths. However, the implementation complexity of adaptive routing can be significant, discouraging its use in commercial massively parallel systems. In this paper we introduce Hierarchical Adaptive Routing (HAR), a new adaptive routing framework which provides a unified framework for simple and high performance fully adaptive deadlock-free wormhole routing. HAR divides the physical network into several levels of virtual networks. There is one connection channel between two adjacent virtual networks that allows blocked packets in the higher level to move to the lower level. Different routing algorithms can be used in each virtual network; and the overall network is deadlock-free provided the rotating algorithm in the lowest level virtual network is deadlock-free. However, the routing algorithm in any other virtual network can be fully adaptive, even non-minimal, to increase performance. HAR has three advantages: fully adaptive deadlock-free routing in any non-wrapped and wrapped k-ary n-cube network with 2 and 3 virtual channels respectively, relatively small crossbars, and applicability to a wide variety of network topologies. Detailed implementation and simulation studies of a HAR for 2D mesh networks are presented.<<ETX>>

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

[2]  William J. Dally,et al.  The J-machine network , 1992, Proceedings 1992 IEEE International Conference on Computer Design: VLSI in Computers & Processors.

[3]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

[4]  Lionel M. Ni,et al.  The turn model for adaptive routing , 1992, ISCA '92.

[5]  P. Messina,et al.  Architectural requirements of parallel scientific applications with explicit communication , 1993, ISCA '93.

[6]  M NiLionel,et al.  The turn model for adaptive routing , 1992 .

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

[8]  William J. Dally,et al.  Network and processor architecture for message-driven computers , 1990 .

[9]  Ziqiang Liu,et al.  HSIM: A Hybrid of Sequential and Parallel Discrete-Event Simulation , 1992, IFIP Congress.

[10]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[11]  Charles L. Seitz,et al.  A family of routing and communication chips based on the Mosaic , 1993 .

[12]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

[13]  Luis Gravano,et al.  Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks , 1992, SPAA '92.

[14]  José Duato,et al.  On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Theoretical Aspects , 1991, EDMCC.

[15]  C. R. Jesshope,et al.  High performance communications in processor networks , 1989, ISCA '89.

[16]  Jae H. Kim,et al.  Compressionless Routing: a framework for adaptive and fault-tolerant routing , 1994, Proceedings of 21 International Symposium on Computer Architecture.