Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
The network architecture of the connection machine CM-5
Journal of Parallel and Distributed Computing
Deadlock-Free Routing in InfiniBand through Destination Renaming
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Effective Strategy to Compute Forwarding Tables for InfiniBand Networks
ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Supporting Fully Adaptive Routing in InfiniBand Networks
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Effective Methodology for Deadlock-Free Minimal Routing in InfiniBand Networks
ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing
Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications
Coping with network failures: routing strategies for optimal demand oblivious restoration
Proceedings of the joint international conference on Measurement and modeling of computer systems
Fast Routing Computation on InfiniBand Networks
IEEE Transactions on Parallel and Distributed Systems
COPE: traffic engineering in dynamic networks
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
On LID assignment in infiniBand networks
Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems
All routes to efficient datacenter fabrics
Proceedings of the 8th International Workshop on Interconnection Network Architecture: On-Chip, Multi-Chip
| Hi-index | 0.00 |
Fat-tree based system area networks have been widely adopted in high performance computing clusters. In such systems, the routing is often deterministic and the traffic demand is usually uncertain and changing. In this paper, we study routing performance on fat-tree based system area networks with deterministic routing under the assumption that the traffic demand is uncertain. The performance of a routing algorithm under uncertain traffic demands is characterized by the oblivious performance ratio that bounds the relative performance of the routing algorithm and the optimal routing algorithm for any given traffic demand. We consider both single path routing where the traffic between each source-destination pair follows one path, and multi-path routing where multiple paths can be used for the traffic between a source-destination pair. We derive lower bounds of the oblivious performance ratio of any single path routing scheme for fat-tree topologies and develop single path oblivious routing schemes that achieve the optimal oblivious performance ratio for commonly used fat-tree topologies. These oblivious routing schemes provide the best performance guarantees among all single path routing algorithms under uncertain traffic demands. For multi-path routing, we show that it is possible to obtain a scheme that is optimal for any traffic demand (an oblivious performance ratio of 1) on the fat-tree topology. These results quantitatively demonstrate that single path routing cannot guarantee high routing performance while multi-path routing is very effective in balancing network loads on the fat-tree topology.