Cited by 35Parallel Computing and Optimization TechniquesCloud Computing and Resource ManagementDistributed and Parallel Computing Systems

Helix: Serving Large Language Models over Heterogeneous GPUs and Network via Max-Flow

Open access
Mei, Yixuan, Zhuang, Yonghao, Miao, Xupeng, Yang, Juncheng, Jia, Zhihao, Vinayak, Rashmi·2025·Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1

Abstract

This paper introduces Helix, a distributed system for high-throughput, low-latency large language model (LLM) serving in heterogeneous GPU clusters. The key idea behind Helix is to formulate inference computation of LLMs over heterogeneous GPUs and network connections as a max-flow problem on directed, weighted graphs, whose nodes represent GPU instances and edges capture both GPU and network heterogeneity through their capacities. Helix then uses a mixed integer linear programming (MILP) algorithm to discover highly optimized strategies to serve LLMs on heterogeneous GPUs. This approach allows Helix to jointly optimize model placement and request scheduling, two highly entangled tasks in heterogeneous LLM serving. Our evaluation on several heterogeneous clusters ranging from 24 to 42 GPU nodes shows that Helix improves serving throughput by up to 3.3x and reduces prompting and decoding latency by up to 66% and 24%, respectively, compared to existing approaches. Helix is available at https://github.com/Thesys-lab/Helix-ASPLOS25.

Integrity signals

Registry

Crossref · 10.1145/3669940.3707215

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Helix [21] optimizes placement on heterogeneous single-cluster GPUs; LoongServe [48] reshapes parallelism for long contexts; ServerlessLLM [47] attacks cold-start latency, a bottleneck we observe in S4 warmup.

    “Helix [21] optimizes placement on heterogeneous single-cluster GPUs; LoongServe [48] reshapes parallelism for long contexts; ServerlessLLM [47] attacks cold-start latency, a bottleneck we observe in S4 warmup.”

No citation lists for this paper

No citation lists for this paper yet — checked again daily.

References 35 · Cited by 35

Authors
Mei, Y., Zhuang, Y., Miao, X., Yang, J., Jia, Z., & Vinayak, R.
Affiliations
  • Carnegie Mellon University (US)
  • Carnegie Mellon University, Pittsburgh, PA, USA
Venue
Proceedings of the 30th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 1
Publisher
ACM
Published
2025-03-30
Pages
586-602
OpenAlex
W4407218342
Cited by
35
References
35
Citations by year
2026: 24 · 2025: 11
FWCI
30.14
Type
conference paper
Language
en
Open access
Locations
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (publishedVersion, cc-by)
Funders
  • National Science Foundation (CNS-2147909,CNS-2211882,CNS-2239351)
  • Amazon
  • Google Cloud Innovator Program
  • Sloan Foundation Fellowship
  • VMware Systems Research Award
  • Meta
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
  • Physical Sciences › Computer Science › Computer Networks and Communications › Distributed and Parallel Computing Systems
Keywords
large language model serving, heterogeneous GPU clusters, mixed-integer linear programming, model placement, request scheduling, inference throughput, decoding latency, distributed inference

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review