A new routing scheme for Jellyfish and its performance with HPC workloads

Authors:
Xin Yuan;Santosh Mahapatra;Wickus Nienaber;Scott Pakin;Michael Lang
Affiliations:
Florida State University, Tallahassee, Fl;Florida State University, Tallahassee, Fl;Florida State University, Tallahassee, Fl;Los Alamos National Laboratory, Los Alamos, New Mexico;Los Alamos National Laboratory, Los Alamos, New Mexico
Venue:
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Year:
2013

Citing 11
Cited 0

Data networks

Data networks
The isoperimetric number of random regular graphs

European Journal of Combinatorics
Deadlock-Free Routing in InfiniBand through Destination Renaming

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
On generalized fat trees

IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Computer Architecture: A Quantitative Approach

Computer Architecture: A Quantitative Approach
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Multi-path TCP: a joint congestion control and routing scheme to exploit path diversity in the internet

IEEE/ACM Transactions on Networking (TON)
Design, implementation and evaluation of congestion control for multipath TCP

Proceedings of the 8th USENIX conference on Networked systems design and implementation
Characterization of the Communication Patterns of Scientific Applications on Blue Gene/P

IPDPSW '11 Proceedings of the 2011 IEEE International Symposium on Parallel and Distributed Processing Workshops and PhD Forum
Jellyfish: networking data centers randomly

NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Limited Multi-path Routing on Extended Generalized Fat-trees

IPDPSW '12 Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium Workshops & PhD Forum

Quantified Score

Hi-index	0.00

Visualization

Abstract

The jellyfish topology where switches are connected using a random graph has recently been proposed for large scale data-center networks. It has been shown to offer higher bisection bandwidth and better permutation throughput than the corresponding fat-tree topology with a similar cost. In this work, we propose a new routing scheme for jellyfish that out-performs existing schemes by more effectively exploiting the path diversity, and comprehensively compare the performance of jellyfish and fat-tree topologies with HPC workloads. The results indicate that both jellyfish and fat-tree topologies offer comparable high performance for HPC workloads on systems that can be realized by 3-level fat-trees using the current technology and the corresponding jellyfish topologies with similar costs. Fat-trees are more effective for smaller systems while jellyfish is more scalable.