Tagged articles
Fat-Tree
11 articles · Page 1 of 1
The article reviews the US‑approved export of Nvidia's DGX H200, the lack of deliveries, Jensen Huang’s surprise China trip that may speed approvals, and then provides a detailed technical breakdown of the DGX H200 cluster’s compute and storage networking, topology, optical link choices, and cable count estimates.
AI infrastructureDGX H200Fat-Tree
0 likes · 8 min read

The article reviews Fat‑Tree, Dragonfly, and Torus network topologies, analyzing their bandwidth, scalability, latency, routing algorithms, and cost trade‑offs for AI‑driven high‑performance computing clusters, and highlights each design's strengths and limitations in large‑scale deployments.
AI computingDragonflyFat-Tree
0 likes · 12 min read

High‑performance computing demands ultra‑low latency and massive scale, prompting a shift from traditional CLOS designs to alternative topologies such as Fat‑Tree, Dragonfly, and Torus, each offering distinct trade‑offs in bandwidth, scalability, routing complexity, and cost‑effectiveness for modern data‑center and HPC environments.
DragonflyFat-TreeHigh-Performance Computing
0 likes · 10 min read

The article analyzes three major high‑performance‑computing network topologies—Fat‑Tree, Dragonfly, and Torus—detailing their design principles, scalability formulas, routing strategies, advantages, and limitations to help architects choose the most suitable architecture for large‑scale GPU clusters.
DragonflyFat-TreeGPU clusters
0 likes · 13 min read

The article analyzes traditional cloud data‑center networking challenges for AI workloads and compares two‑layer and three‑layer fat‑tree architectures, presenting high‑bandwidth, non‑blocking, and low‑latency designs such as AI‑Pool networks and offering practical deployment scales from hundreds to tens of thousands of GPUs.
AI computeFat-TreeHigh Bandwidth
0 likes · 11 min read

This article analyzes traditional cloud data center network limitations for AI workloads and compares various high‑bandwidth, low‑latency architectures—including two‑layer and three‑layer fat‑tree designs, InfiniBand, and RoCE—providing best‑practice recommendations for building scalable, non‑blocking AI‑Pool networks.
AI computingFat-TreeGPU clusters
0 likes · 12 min read

The rapid growth of AI large‑model training and inference is pushing data‑center networks toward non‑blocking Fat‑Tree topologies and ultra‑high‑speed 400G/800G optical modules to meet massive bandwidth, low‑latency, and multi‑task concurrency requirements.
400G800GAI
0 likes · 8 min read

This article analyzes the evolving data‑center network architectures for large AI clusters, detailing leaf‑spine and Fat‑Tree designs, NVLink interconnects, and calculating the precise optical‑module requirements for NVIDIA A100, H100, and GH200 deployments, while also comparing industry examples from Meta, AWS, and Google.
AI clustersFat-TreeNVLink
0 likes · 12 min read

The article analyzes the limitations of traditional data‑center networking for AI compute workloads and presents high‑bandwidth, non‑blocking, low‑latency design solutions—including two‑layer and three‑layer fat‑tree architectures, AI‑Pool concepts, and recommended configurations—for building scalable, efficient intelligent computing clusters.
AI computeFat-TreeHigh Bandwidth
0 likes · 10 min read

The article explains the Fat-Tree (CLOS) network topology introduced in 2008, describing its non‑convergent bandwidth design, three‑layer structure, practical benefits, common configurations, and limitations, while also providing references and visual illustrations of the architecture.
CLOSData Center NetworkFat-Tree
0 likes · 7 min read

This article provides a comprehensive overview of Mellanox's InfiniBand solutions, covering the company's background, network architecture, routing algorithms, Fat‑Tree topology, the OFED software stack, management tools, MPI support, adapters, switches, routers, cables, and related products for high‑performance computing and cloud data centers.
Fat-TreeHigh-Performance ComputingInfiniBand
0 likes · 21 min read
