Context Parallelism for Scalable Million-Token Inference
Yang, Amy, Yang, Jingyi, Ibrahim, Aya, Xie, Xinfeng, Tang, Bangsheng, Sizov, Grigory, Reizenstein, Jeremy, Park, Jongsoo, Huang, Jianyu
–arXiv.org Artificial Intelligence
We present context parallelism for long-context large language model inference, which achieves near-linear scaling for long-context prefill latency with up to 128 H100 GPUs across 16 nodes. Particularly, our method achieves 1M context prefill with Llama3 405B model in 77s (93% parallelization efficiency, 63% FLOPS utilization) and 128K context prefill in 3.8s. We develop two lossless exact ring attention variants: pass-KV and pass-Q to cover a wide range of use cases with the state-of-the-art performance: full prefill, persistent KV prefill and decode. Benchmarks on H100 GPU hosts inter-connected with RDMA and TCP both show similar scalability for long-context prefill, demonstrating that our method scales well using common commercial data center with medium-to-low inter-host bandwidth.
arXiv.org Artificial Intelligence
Nov-10-2024
- Country:
- Europe > Italy
- Calabria > Catanzaro Province > Catanzaro (0.04)
- Asia > Middle East
- Jordan (0.04)
- Europe > Italy
- Genre:
- Research Report (0.40)
- Industry:
- Information Technology (0.34)
- Technology: