Limited Multi-path Routing on Extended Generalized Fat-trees
Authors:
- Santosh MahapatraSMSantosh Mahapatra
- Xin YuanXYXin Yuan
- Wickus NienaberWNWickus Nienaber
- 1 May 2012
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 938-945
Abstract
We consider a general form of routing, called limited multi-path routing, on extended generalized fat-trees where the number of paths between each pair of processing nodes is a parameter. Existing single-path routing and multi-path routing for such topologies are special cases of limited multi- path routing. We propose path calculation heuristics, including shift-1, disjoint, and random for limited multi-path routing on extended generalized fat-trees. All of these heuristics are based on existing single-path routing schemes, work for limited multi-path routing with any given number of paths between processing nodes, gracefully increase routing performance as the number increases, and reach optimal when all shortest paths between processing nodes are allowed for carrying traffics. Flow-level and flit-level simulation experiments are carried out to study the performance. The results show that the disjoint heuristic significantly out-performs the other methods.Keywords
This publication has 14 references indexed in Scilit:
- Oblivious routing schemes in extended generalized Fat Tree networks2009
- Oblivious Routing in Fat-Tree Based System Area Networks With Uncertain Traffic DemandsIEEE/ACM Transactions on Networking, 2009
- Multistage switches are not crossbars: Effects of static routing in high-performance networks2008
- Optimization of infiniband for scientific applications2008
- Adaptive Routing in High-Radix Clos Network2006
- A multiple LID routing scheme for fat-tree-based infiniband networks2004
- Making intra-domain routing robust to changing and uncertain traffic demands2003
- On generalized fat trees2002
- Improving routing performance in Myrinet networks2002
- Randomized routing on fat-tress1985