RUNLOCALAIv38
->Will it run?Best GPUCompareTroubleshootStartLearnPulseModelsHardwareToolsBench
Run check
RUNLOCALAI

Independently operated catalog for local-AI hardware and software. Hand-written verdicts. Source-cited claims. Reproducible commands when we have them.

OP·Eruo Fredoline
DIR
  • Models
  • Hardware
  • Tools
  • Benchmarks
TOOLS
  • Will it run?
  • Compare hardware
  • Cost vs cloud
  • Choose my GPU
  • Prompting kits
  • Quick answers
REF
  • All buyer guides
  • Learn local AI
  • Methodology
  • Glossary
  • Errors KB
  • Trust
EDITOR
  • About
  • Author
  • How we make money
  • Editorial policy
  • Contact
LEGAL
  • Privacy
  • Terms
  • Sitemap
MAIL · MONTHLY DIGEST
Get monthly local AI changes
Monthly recap. No spam.
DISCLOSURE

Some links on this site are affiliate links (Amazon Associates and other first-class retailers). When you buy through them, we earn a small commission at no extra cost to you. Affiliate links do not influence our verdicts — there are cards we rate highly that we don't have affiliate relationships with, and cards that sell well that we refuse to recommend. Read more →

© 2026 runlocalai.coIndependently operated
RUNLOCALAI · v38
  1. >
  2. Home
  3. /Learn
  4. /Courses
  5. /Local AI Clusters
  6. /Ch. 2
Local AI Clusters

02. Cluster Topology

Chapter 2 of 18 · 10 min
KEY INSIGHT

LLM collective communication patterns require high-bandwidth, low-latency networks. The bandwidth demand of all-reduce operations scales with the cluster size—misjudging network capacity is the most common cluster topology failure.

A local AI cluster topology defines how machines interconnect for distributed training and serving. The configuration affects throughput, latency, and failure handling differently than traditional HPC or web service clusters.

LLM workloads have distinct characteristics that inform topology decisions. Most time is spent in collective operations—all-reduce for tensor parallelism and all-gather for pipeline parallelism. Unlike traditional HPC simulations, LLM clusters experience high frequency of these collective calls. Network bandwidth and latency directly impact training convergence and serving latency.

Common topologies include fat-tree, dragonfly, and torus configurations. Fat-tree provides predictable bandwidth with commodity switches but introduces multiple network hops. Dragonfly uses high-radix routers to reduce hop count, improving collective performance at higher hardware cost. Torus topologies excel for the regular communication patterns in pipeline parallelism.

Local verification checkpoint

Run the smallest example from this chapter in a local workspace and record the package version, runtime, data path, and observed output. If the result depends on model size, vector count, CPU/GPU backend, or available memory, note that constraint beside the exercise so the lesson remains reproducible.

Local verification checkpoint

Run the smallest example from this chapter in a local workspace and record the package version, runtime, data path, and observed output. If the result depends on model size, vector count, CPU/GPU backend, or available memory, note that constraint beside the exercise so the lesson remains reproducible.

EXERCISE

Map your intended cluster scale to collective operation frequency. For tensor parallelism across N GPUs, estimate all-reduce bandwidth as (model size × gradient compression factor) ÷ collective_time. Cross-reference against your network switch capacity.

← Chapter 1
Why Cluster?
Chapter 3 →
Network Requirements