MMLRU Selection Function: A Simple and Efficient Output Selection Function in Adaptive Routing

Adaptive routing algorithms, which dynamically select the route of a packet, have been widely studied for interconnection networks in massively parallel computers. An output selection function (OSF), which decides the output channel when some legal channels are free, is essential for an adaptive routing. In this paper, we propose a simple and efficient OSF called minimal multiplexed and least-recently-used (MMLRU). The MMLRU selection function has the following simple strategies for distributing the traffic: 1) each router locally grasps the congestion information by the utilization ratio of its own physical channels; 2) it is divided into the two selection steps, the choice from available physical channels and the choice from available virtual channels. The MMLRU selection function can be used on any type of network topology and adaptive routing algorithm. Simulation results show that the MMLRU selection function improves throughput and latency especially when the number of dimension becomes larger or the number of nodes per dimension become larger. key words: output selection function, adaptive routing, virtual channel, interconnection networks, massively parallel computers

[1]  Pedro López,et al.  Improving routing performance in Myrinet networks , 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000.

[2]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[3]  Hideharu Amano,et al.  Routing algorithms based on 2D turn model for irregular networks , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[4]  Wu-chun Feng,et al.  The Quadrics network (QsNet): high-performance clustering technology , 2001, HOT 9 Interconnects. Symposium on High Performance Interconnects.

[5]  Hideharu Amano,et al.  Performance Evaluation of a Prototype of RHiNET-2: A Network-based Distributed Parallel Computing System , 2003, Applied Informatics.

[6]  Loren Schwiebert,et al.  Performance Tuning of Adaptive Wormhole Routing through Selection Function Choice , 2002, J. Parallel Distributed Comput..

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

[8]  Hideharu Amano,et al.  Performance evaluation of RHiNET 2/NI: a network interface for distributed parallel computing systems , 2003, CCGrid 2003. 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid, 2003. Proceedings..

[9]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[10]  Kang G. Shin,et al.  Impact of selection functions on routing algorithm performance in multicomputer networks , 1997, ICS '97.

[11]  Camino de Vera.  High-Performance Routing in Networks of Workstations with Irregular Topology , 2000 .

[12]  Hideharu Amano,et al.  MMLRU Selection Function: An Output Selection Function on Adaptive Routing , 2001, ISCA PDCS.

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

[14]  Pedro López,et al.  On the Influence of the Selection Function on the Performance of Networks of Workstations , 2000, ISHPC.

[15]  Maurice Yarrow,et al.  New Implementations and Results for the NAS Parallel Benchmarks 2 , 1997, PPSC.

[16]  Hussein G. Badr,et al.  An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies , 1989, IEEE Trans. Computers.

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

[18]  Hideharu Amano,et al.  Performance evaluation of routing algorithms in RHiNET-2 cluster , 2003, 2003 Proceedings IEEE International Conference on Cluster Computing.

[19]  H. Amano,et al.  RHINET: a network for high performance parallel computing using locally distributed computers , 1999, Innovative Architecture for Future Generation High-Performance Processors and Systems (Cat. No.PR00650).

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

[21]  Hideharu Amano,et al.  The impact of output selection function on adaptive routing , 2001, Computers and Their Applications.

[22]  Loren Schwiebert.  A performance evaluation of fully adaptive wormhole routing including selection function choice , 2000, Conference Proceedings of the 2000 IEEE International Performance, Computing, and Communications Conference (Cat. No.00CH37086).

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

[24]  Jie Wu.  An optimal routing policy for mesh-connected topologies , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[25]  Hideharu Amano,et al.  The Impact of Path Selection Algorithm of Adaptive Routing for Implementing Deterministic Routing , 2002, PDPTA.

[26]  Camino de Vera.  On the Use of Virtual Channels in Networks of Workstations with Irregular Topology , 2000 .

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