Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing
Siamese-Twin: A Dynamically Fault-Tolerant Fat-Tree
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Design tradeoffs for tiled CMP on-chip networks
Proceedings of the 20th annual international conference on Supercomputing
International Journal of Computer Mathematics
Trace-driven co-simulation of high-performance computing systems using OMNeT++
Proceedings of the 2nd International Conference on Simulation Tools and Techniques
Exploring pattern-aware routing in generalized fat tree networks
Proceedings of the 23rd international conference on Supercomputing
HyperX: topology, routing, and packaging of efficient large-scale networks
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Design of High-Radix Clos Network-on-Chip
NOCS '10 Proceedings of the 2010 Fourth ACM/IEEE International Symposium on Networks-on-Chip
USENIXATC'11 Proceedings of the 2011 USENIX conference on USENIX annual technical conference
Cross-layer flow and congestion control for datacenter networks
Proceedings of the 3rd Workshop on Data Center - Converged and Virtual Ethernet Switching
sFtree: A fully connected and deadlock-free switch-to-switch routing algorithm for fat-trees
ACM Transactions on Architecture and Code Optimization (TACO) - HIPEAC Papers
HotCloud'11 Proceedings of the 3rd USENIX conference on Hot topics in cloud computing
Reducing the impact of soft errors on fabric-based collective communications
Euro-Par'11 Proceedings of the 2011 international conference on Parallel Processing - Volume 2
Fat-tree routing and node ordering providing contention free traffic for MPI global collectives
Journal of Parallel and Distributed Computing
PAST: scalable ethernet for data centers
Proceedings of the 8th international conference on Emerging networking experiments and technologies
Bandwidth-optimal all-to-all exchanges in fat tree networks
Proceedings of the 27th international ACM conference on International conference on supercomputing
A new routing scheme for Jellyfish and its performance with HPC workloads
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Plinko: building provably resilient forwarding tables
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Fast pattern-specific routing for fat tree networks
ACM Transactions on Architecture and Code Optimization (TACO)
A new proposal to deal with congestion in InfiniBand-based fat-trees
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
We introduce and analyze a new family of multiprocesser interconnection networks, called generalized fat trees, which include as special cases the fat trees used for the connection machine architecture CM-5, pruned butterflies, and various other fat trees proposed in the literature. The generalized fat trees provide a formal unifying concept to design and analyse a fat tree based architecture. The extended generalized fat tree network XGFT(h; m/sub 1/, ..., m/sub h/; w/sub 1/, ..., w/sub h/) of height h has /spl Pi//sub i=1//sup h/ m/sub i/ leaf processors and the inner nodes serve only as switches or routers. Each non-leaf node in level i has m/sub i/ children and each non-root has w/sub i+1/ parent nodes. The generalized fat trees provide regularity, symmetry, recursive scalability, maximal fault-tolerance, logarithmic diameter bisection scalability, and permit simple algorithms for fault tolerant self-routing and broadcasting. These networks are also versatile, since they can efficiently embed rings, meshes and tori, trees, pyramids and hypercubes.