Boosting the Performance of Myrinet Networks

Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. These networks allow the customer to connect processors using irregular topologies, providing the wiring flexibility, scalability and incremental expansion capability required in this environment. Some of these networks use source routing and wormhole switching. In particular, we are interested in Myrinet networks because they are a well-known commercial product and their behavior can be controlled by the software running on the network interfaces (the Myrinet Control Program, MCP). Usually, the Myrinet network uses up*/down* routing for computing the paths for every source-destination pair. In this paper, we propose an in-transit buffer (ITB) mechanism to improve the network performance. We apply the ITB mechanism to NOWs with up*/down* source routing, like the Myrinet, analyzing its behavior on networks with both regular and irregular topologies. The proposed scheme can be implemented on Myrinet networks by simply modifying the MCP, without changing the network hardware. We evaluate by simulation several networks with different traffic patterns using timing parameters taken from the Myrinet network. The results show that the current routing schemes used in Myrinet networks can be strongly improved by applying the ITB mechanism. In general, our proposed scheme is able to double the network throughput on medium and large NOWs. Finally, we present a first implementation of the ITB mechanism on a Myrinet network.

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

[2]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[3]  Ludmila Cherkasova,et al.  Fibre channel fabrics: evaluation and design , 1996, Proceedings of HICSS-29: 29th Hawaii International Conference on System Sciences.

[4]  Robert W. Horst,et al.  ServerNet deadlock avoidance and fractahedral topologies , 1996, Proceedings of International Conference on Parallel Processing.

[5]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

[6]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[7]  Andrew A. Chien,et al.  An evaluation of planar-adaptive routing (PAR) , 1992, [1992] Proceedings of the Fourth IEEE Symposium on Parallel and Distributed Processing.

[8]  Federico Silla,et al.  Improving the efficiency of adaptive routing in networks with irregular topology , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[9]  Anna R. Karlin,et al.  Factors in the performance of the AN1 computer network , 1992, SIGMETRICS '92/PERFORMANCE '92.

[10]  James R. Goodman,et al.  The Impact of Pipelined Channels on k-ary n-Cube Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[11]  Antonio Robles,et al.  Efficient Adaptive Routing in Networks of Workstations with Irregular Topology , 1997, CANPC.

[12]  Antonio Robles,et al.  A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks , 2000, CANPC.

[13]  William J. Dally,et al.  Express Cubes: Improving the Performance of k-Ary n-Cube Interconnection Networks , 1989, IEEE Trans. Computers.

[14]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..