Deployable Self-Planning: GPU Fleet Layouts from Past Traffic at 2× and 3× Load

A consolidation system is only deployable if it can choose its GPU layout without knowing the future. We evaluate Nodus as a black box that plans its own fleet layout from observed past traffic, on a single 8× H100 SXM node serving 32 tenants, replaying the same trace to Nodus and to one dedicated GPU per tenant. At 3× traffic, Nodus runs on 6 GPUs at 99.78% lowest per-class SLO attainment with 0 errors, versus 32 dedicated GPUs: 5.333× fewer GPUs, 5.329× more SLO-met requests per GPU-second, and 5.384× lower cost per million SLO-met tokens ($2.1088 vs $11.3528). At 2× traffic, planning from past traffic only—with no foresight—chooses 6 GPUs (one more than a perfect-foresight plan's 5) and delivers 5.33× fewer GPUs and 5.34× lower cost than dedicated. Across 1×, 2×, and 3× traffic, GPU demand grows sub-linearly: 4, 5, and 6 GPUs versus 32 dedicated.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-03
DOI
https://doi.org/10.5281/zenodo.23912511
Primary Topic
Cloud Computing and Resource Management
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
preprint

Deployable Self-Planning: GPU Fleet Layouts from Past Traffic at 2× and 3× Load

Pranav Varshney, Viswa Kotra
Zenodo (CERN European Organization for Nuclear Research)
Cloud Computing and Resource Management
preprint

Deployable Self-Planning: GPU Fleet Layouts from Past Traffic at 2× and 3× Load

Pranav Varshney, Viswa Kotra
preprint en

Abstract

A consolidation system is only deployable if it can choose its GPU layout without knowing the future. We evaluate Nodus as a black box that plans its own fleet layout from observed past traffic, on a single 8× H100 SXM node serving 32 tenants, replaying the same trace to Nodus and to one dedicated GPU per tenant. At 3× traffic, Nodus runs on 6 GPUs at 99.78% lowest per-class SLO attainment with 0 errors, versus 32 dedicated GPUs: 5.333× fewer GPUs, 5.329× more SLO-met requests per GPU-second, and 5.384× lower cost per million SLO-met tokens ($2.1088 vs $11.3528). At 2× traffic, planning from past traffic only—with no foresight—chooses 6 GPUs (one more than a perfect-foresight plan's 5) and delivers 5.33× fewer GPUs and 5.34× lower cost than dedicated. Across 1×, 2×, and 3× traffic, GPU demand grows sub-linearly: 4, 5, and 6 GPUs versus 32 dedicated.

Zenodo (CERN European Organization for Nuclear Research)
Cloud Computing and Resource Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon