Pith. sign in

REVIEW 2 cited by

Optimal Workload Placement on Multi-Instance GPUs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2409.06646 v1 pith:OSLC2BGJ submitted 2024-09-10 cs.DC

Optimal Workload Placement on Multi-Instance GPUs

classification cs.DC
keywords gpusworkloadsmethodcasesgoalheuristicsmulti-instancemultiple
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

There is an urgent and pressing need to optimize usage of Graphical Processing Units (GPUs), which have arguably become one of the most expensive and sought after IT resources. To help with this goal, several of the current generation of GPUs support a partitioning feature, called Multi-Instance GPU (MIG) to allow multiple workloads to share a GPU, albeit with some constraints. In this paper we investigate how to optimize the placement of Large Language Model (LLM)-based AI Inferencing workloads on GPUs. We first identify and present several use cases that are encountered in practice that require workloads to be efficiently placed or migrated to other GPUs to make room for incoming workloads. The overarching goal is to use as few GPUs as possible and to further minimize memory and compute wastage on GPUs that are utilized. We have developed two approaches to address this problem: an optimization method and a heuristic method. We benchmark these with two workload scheduling heuristics for multiple use cases. Our results show up to 2.85x improvement in the number of GPUs used and up to 70% reduction in GPU wastage over baseline heuristics. We plan to enable the SRE community to leverage our proposed method in production environments.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Taming GPU Underutilization via Static Partitioning and Fine-grained CPU Offloading

    cs.DC 2026-04 unverdicted novelty 5.0

    Static MIG partitioning cuts GPU underutilization in scientific workloads but leaves interference and coarse-grained mismatches; a Nvlink-C2C offloading scheme is introduced to bridge those gaps.

  2. SMART-MIG: A Learning Framework for Scalable and Energy-Efficient GPU Scheduling

    cs.DC 2026-06 unverdicted novelty 3.0

    SMART-MIG applies MF-MARL for constant-complexity MIG repartitioning plus heuristics for scheduling, reporting 18% better energy-tardiness efficiency than static partitioning and 27% above a theoretical energy lower bound.