Improving Routing Performance in Myrinet Networks

Authors:
Affiliations:
Venue:
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Year:
2000

Citing 0
Cited 12

Performance evaluation of a new routing strategy for irregular networks with source routing

Proceedings of the 14th international conference on Supercomputing
Evaluation of Alternative Arbitration Policies for Myrinet Switches

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Improving Network Performance by Reducing Network Contention in Source-Based COWs with a Low Path-Computation Overhead

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing

ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
On Deadlock Frequency during Dynamic Reconfiguration in NOWs

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
Improving the Performance of Regular Networks with Source Routing

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Supporting adaptive routing in IBA switches

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Evolutions in parallel distributed and network-based processing
Path selection algorithm: the strategy for designing deterministic routing from alternative paths

Parallel Computing
Exploring pattern-aware routing in generalized fat tree networks

Proceedings of the 23rd international conference on Supercomputing
Users matter: a multi-agent systems model of high performance computing cluster users

MABS'04 Proceedings of the 2004 international conference on Multi-Agent and Multi-Agent-Based Simulation
On the influence of the selection function on the performance of fat-trees

Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Bandwidth-optimal all-to-all exchanges in fat tree networks

Proceedings of the 27th international ACM conference on International conference on supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Networks of workstations (NOWs) are becoming increasingly popular as a cost-effective alternative to parallel computers. Typically, these networks connect processors using irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment.In some of these networks, packets are delivered using source routing. Due to the irregular topology, the routing scheme is often non-minimal. In this paper we analyze the routing scheme used in Myrinet networks in order to improve its performance. We propose new routing algorithms that balance the utilization of the available routes and always use minimal paths.We show through simulation that the current routing schemes used in Myrinet networks can be improved by modifying only the routing software without increasing the software overhead significantly. The overall throughput can be doubled without modifying the network hardware.