atlas

Research map / Large language models / Reasoning and chain of thought

Demystifying Cost-Efficiency in LLM Serving over Heterogeneous GPUs

ICML 2025 · Large language models › Reasoning and chain of thought · approach: Efficient LLM serving · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Benchmarks LLM serving across heterogeneous cloud GPU types and formulates a MILP scheduler that jointly chooses GPU composition, deployment configuration (DP/TP/PP), and workload assignment under budget and GPU availability constraints.

Problem

Serving diverse LLM requests on homogeneous GPUs is cost-inefficient, and existing heterogeneous serving systems ignore real-time cloud GPU availability and user price budgets as well as workload heterogeneity.

Approach

Co-optimize which heterogeneous GPUs to rent, how to parallelize them into model replicas, and how to split workload types across replicas via a MILP minimizing makespan under budget and availability constraints, with binary search and knapsack-based feasibility checks for scalability.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
jointly optimize GPU composition, deployment configuration, and workload assignmentLLM serving with heterogeneous cloud GPUs · Across evaluated traces, GPU availabilities, budgets, and modelsthroughput: up to 41% (25% on average)Helped
jointly optimize GPU composition, deployment configuration, and workload assignmentLLM serving with heterogeneous cloud GPUs · Across evaluated traces, GPU availabilities, budgets, and modelspercentile latency: up to 54% (20% on average)Helped
use workload-aware scheduling with the optimal GPU compositionHexGen · Heterogeneous serving comparisonsperformance: up to 18% and on average 14%Helped
optimize GPU composition instead of renting GPUs uniformly across six types (ablation)Ours scheduling algorithm · Llama3-70B, traces 1 and 2throughput: up to 27% (average: 20%)Helped
optimize deployment configuration per model replica instead of applying TP uniformly (ablation)Ours scheduling algorithm · Llama3-70B, traces 1 and 2throughput: up to 34% (average: 33%)Helped
use heterogeneous-aware workload assignment instead of Round-Robin assignment (ablation)Ours scheduling algorithm · Llama3-70B, traces 1 and 2throughput: up to 32% (average: 29%)Helped
use binary search with feasibility checks and knapsack approximation instead of exhaustive MILP searchScheduling algorithm · Large-scale searchsearch time: approximately a 4× reductionHelped
use binary search instead of exhaustive MILP searchScheduling algorithm · Large-scale searchalgorithm performance: deviations of less than 1%No clear effect
jointly optimize resource allocation for multiple modelsOurs scheduling algorithm · Multi-model serving: Llama3-8B and Llama3-70Bperformance: up to a 35% (average: 23%)Helped
replan GPU composition after a workload distribution shiftHeterogeneous serving on Azure-Trace · Azure-Trace workload surgethroughput: 23.70 req/s -> 29.61 req/s (25%↑)Helped
replan after a GPU availability dropHeterogeneous serving on Azure-Trace · 4 H100s downthroughput: 20.80 req/s -> 22.85 req/s (10%↑)Helped

Surprising findings

Limitations

Experimental setup

Datasets: Swiss AI Center traces ShareGPT WildChat Azure-Trace

Benchmarks: Swiss AI Center traces Azure-Trace WildChat

Metrics: throughput percentile latency (p10-p100) cost efficiency (throughput per unit price)

Baselines: HexGen Helix Homogeneous H100 Homogeneous A6000 Homogeneous 4090

Builds on: HexGen Helix Vidur vLLM

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy