Communication Compression for Tensor Parallel LLM Inference

Jan Hansen-Palmus, Michael Truong Le, Oliver Hausdörfer, Alok Verma
11/14/2024
cs.LGcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

Large Language Models (LLMs) have pushed the frontier of artificial intelligence but are comprised of hundreds of billions of parameters and operations. For faster inference latency, LLMs are deployed on multiple hardware accelerators through various Model Parallelism strategies. Our paper looks into the details on one such strategy - Tensor Parallel - and proposes to reduce latency by compressing inter-accelerator communication. We leverage fine grained quantization techniques to compress selected activations by 3.5 - 4.5x. Our proposed method leads up to 2x reduction of time-to-first-token (TTFT) with negligible model performance degradation.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{hansenpalmus2024communication,
  title  = {Communication Compression for Tensor Parallel LLM Inference},
  author = {Jan Hansen-Palmus and Michael Truong Le and Oliver Hausdörfer and Alok Verma},
  year   = {2024},
  eprint = {2411.09510},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2411.09510v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2411.09510.svg)](https://codeofpaper.com/paper/2411.09510)

Discussion