The canonical autoregressive decoding loop of large language models presents a fundamental systems challenge: each token requires O(d2) matrix operations where d is the hidden dimension, yet the memory bandwidth bottleneck of GPU-attached HBM imposes a floor on per-token latency. For private AI serving — where data sovereignty mandates on-premise deployment and latency SLAs require <100ms end-to-end — the architectural decisions governing distributed inference determine viability.

We present a taxonomy of distributed inference patterns and their latency-throughput Pareto frontiers, grounded in measurements from production deployments serving 7B to 405B parameter models across 8-node clusters of NVIDIA H100 and AMD MI350X accelerators.

The Distributed Inference Taxonomy

Distributed inference decomposes along four orthogonal axes. Tensor parallelism splits individual weight matrices across devices. Pipeline parallelism partitions transformer layers into stages. Data parallelism replicates the full model and splits request batches. Speculative decoding uses a draft model to propose tokens accepted in parallel by a target model. Each strategy presents distinct implications for the latency-bandwidth product.