Scaling LLM Inference via Parallelism: Throughput-Latency Trade-off
Read the original on arXiv Machine Learning →The paper investigates how different parallelism strategies—tensor parallelism (TP), pipeline parallelism (PP), and hybrids—affect the trade‑off between time‑to‑first‑token (TTFT) and inter‑token latency (ITL) in large language model inference. It introduces a framework that maps feasible TTFT‑ITL regions and Pareto frontiers for various workloads, revealing a shift from TP‑dominant to PP‑dominant configurations as prefill work increases. The authors also present an SLO‑aware selection method based on goodput, showing that stricter TTFT goals favor PP, while relaxed constraints move toward TP, and they demonstrate that longer contexts further favor PP for scalability and SLO attainment.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.