Improving routing performance in Myrinet networks

Flich, José; Malumbres, Manuel P.; López, Pedro; Duato, J.

doi:10.1109/ipdps.2000.845961

Cited by 29 publications

(21 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Several oblivious schemes to do so have been proposed. Random routing [16], [17], consists in randomly assigning NCAs to the communicating pairs. It is used as the default mechanism in Myrinet and InfiniBand interconnects.…”

Section: Routing In Xgftsmentioning

confidence: 99%

Oblivious routing schemes in extended generalized Fat Tree networks

Rodríguez

Minkenberg

Beivide

et al. 2009

2009 IEEE International Conference on Cluster Computing and Workshops

View full text Add to dashboard Cite

Abstract-A family of oblivious routing schemes for Fat Trees and their slimmed versions is presented in this work. First, two popular oblivious routing algorithms, which we refer to as S-mod-k and D-mod-k, are analyzed in detail. S-mod-k is the default routing algorithm given as an example in the first works formally describing Fat Tree networks. D-mod-k has been independently proposed and investigated by several authors, who conclude in their evaluations that it achieves better performance than a random or adaptive routing approach. First, we identify the reasons why these algorithms perform well. Using this insight we extend these algorithms, originally intended for full bisection networks, to slimmed networks. Based on the lessons learned we propose a new generalized family of algorithms that provides a better oblivious solution than the existing ones for this class of networks. Moreover, this family extends the previous work from k-ary n-trees to the more general class of extended generalized fat trees.

show abstract

Section: Routing In Xgftsmentioning

confidence: 99%

Oblivious routing schemes in extended generalized Fat Tree networks

Rodríguez

Minkenberg

Beivide

et al. 2009

2009 IEEE International Conference on Cluster Computing and Workshops

View full text Add to dashboard Cite

show abstract

“…The in-transit host will re-inject the packet into the network as soon as possible, forwarding it to the destination host or to the next in-transit host. Although several minimal paths may exist between each pair of nodes, only one of them will be used because performance does not increase significantly when using several minimal paths [4].…”

Section: Myrinet Source Routingmentioning

confidence: 99%

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

Flich

Malumbres

López

et al. 2000

Proceedings of the 14th International Conference on Supercomputing

Self Cite

View full text Add to dashboard Cite

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, messages are delivered using the up*/down* routing algorithm [9]. However, the up*/down* routing scheme is often non-minimal. Also, some of these networks use source routing [1]. With this technique, the entire path to destination is generated at the source host before the message is sent.In this paper we develop a new mechanism in order to improve the performance of irregular networks with source routing, increasing overall throughput. With this mechanism, messages always use minimal paths. To avoid possible deadlocks, when necessary, routes between a pair of hosts are divided into sub-routes, and a special kind of virtual cut-through is performed at some intermediate hosts. We evaluate the new mechanism by simulation using parameters taken from the Myrinet network. We show that the current routing schemes used in Myrinet can be improved by modifying only the routing software without increasing its overhead siguificantly and, most importantly, without modifying the network hardware. The benefits of using the new routing scheme are noticeable for networks with 16 or more switches, and increase with network size. For 32 and 64-switch networks, throughput is increased on average by a factor ranging from 1.3 to 3.3.

show abstract

“…In this paper, we propose the use of a mechanism that removes channel dependences without restricting routing. This mechanism has been first proposed in [3] to improve up*/down* routing, but it can be applied to any routing algorithm. In this paper we will apply it to improved routing schemes (Smart and DFS).…”

Section: Introductionmentioning

confidence: 99%

Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing

Flich

López

Malumbres

et al. 2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In previous papers we proposed the ITB mechanism to improve the performance of up*/down* routing in irregular networks with source routing. With this mechanism, both minimal routing and a better use of network links are guaranteed, resulting on an overall network performance improvement. In this paper, we show that the ITB mechanism can be used with any source routing scheme in the COW environment. In particular, we apply ITBs to DFS and routing algorithms, which provide better routes than up*/down* routing. Results show that ITB strongly improves DFS and Smart throughput (by 63% and 23%, respectively, for 64-switch networks).

show abstract

Improving routing performance in Myrinet networks

Abstract: Networks of workstations (NOWs)

Cited by 29 publications

References 7 publications

Oblivious routing schemes in extended generalized Fat Tree networks

Oblivious routing schemes in extended generalized Fat Tree networks

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

Combining In-Transit Buffers with Optimized Routing Schemes to Boost the Performance of Networks with Source Routing

Contact Info

Product

Resources

About