Skip to content

NELSSA: A GPU-PNM Heterogeneous System for Mixed-Length LLM Serving via Length-based Request Placement

Jul 2026 · arXiv.org · Vol abs/2607.26633 · 0 citations · 62 references
Computer Science

TL;DR

NELSSA is presented, an LLM serving system that integrates GPUs with real-world Processing-near-Memory accelerator devices to efficiently support mixed-length workloads and improves decode throughput by up to 5.5x in tokens/sec and reduces P99 latency by up to 15x compared to GPU-only baselines.

Abstract

Modern LLMs and their agentic applications are broadening the range of serving workloads, spanning context lengths from a few hundred tokens to hundreds of thousands. As these requests frequently interleave within the same serving window, LLM serving systems must handle highly heterogeneous mixed-length workloads. Such mixed-length workloads expose fundamental inefficiencies in GPU-centric serving architectures, whose throughput depends on large, memory-constrained batches. In this paper, we present NELSSA, an LLM serving system that integrates GPUs with real-world Processing-near-Memory (PNM) accelerator devices to efficiently support mixed-length workloads. NELSSA employs length-based request placement to route short-context requests to GPUs and long-context requests to the PNM tier, incorporating runtime migration to accommodate dynamic context growth without recomputation. We prototype NELSSA as an end-to-end system, implementing device-level sparse attention on PNM, GPU decode kernels, and a host-side runtime that orchestrates scheduling and cross-tier memory movement over a CXL-enabled infrastructure with RPC and RDMA support. Across mixed-length LLM workloads, NELSSA improves decode throughput by up to 5.5x in tokens/sec and reduces P99 latency by up to 15x compared to GPU-only baselines. Our end-to-end prototype and experimental results suggest that integrated GPU-PNM serving, enabled by CXL-based disaggregation, is a promising system paradigm for scalable and flexible LLM infrastructures that support evolving workloads.

View source

Similar papers

Book Open access Sep 2026

Adaptive GPU Sharing for Real-time LLM Serving with Best-effort Workloads

Large Language Models (LLMs) are increasingly deployed in latency-sensitive applications, where real-time serving must satisfy stringent service-level objectives (SLOs). However, request intensities fluctuate over time, and under low load LLM services leave a substantial fraction of GPU task idle. A promising approach...

Shu-Xin Li, Toshihiro Hanawa, Yohei Miki · 0 citations
Preprint Aug 2026

PLoRA: An NDP-Enhanced Pooled-Memory System for Cost-Efficient Multi-LoRA Serving

Multi-LoRA serving is how one base model becomes thousands of specialized variants, one adapter per user, task, or agent, and the deployments can hold 1000-plus adapters. Serving them is hard because the workload inverts what GPUs provide: terabytes of memory against only tens of TFLOPS, and because every published sys...

Zhong-Kai Yu, O. Venkatachalam, Zheng Wang et al. · 0 citations
Preprint Aug 2026

Heterogeneous LLM Serving with General-Purpose Processing-Near-Memory for Retrieval-Based Sparse Attention

A heterogeneous decode-phase serving system that relocates the KV cache out of GPU memory, motivated by the retrieval-based sparse attention that recent frontier LLMs adopt to serve million-token contexts and proposes KARAT, a general-purpose PNM design that is the design point meeting all four requirements.

Hyungkyu Ham, Junhyeong Bae, Seungheon Lee et al. · 1 citation
Preprint Sep 2026

VarioPath: Workload-Aware All-to-All Communication for PCIe GPU Clusters

VarioPath, an efficient AlltoAllv scheduling framework for PCIe GPU systems that combines an offline topology-aware analyzer with an online demand-aware scheduler, and shows average AlltoAllv speedups of 5.88x over FAST and 1.72x over DeepEP.

Yao Fei, Jin Fang, Si-Ze Zheng et al. · 0 citations
Preprint Sep 2026

Adaptive Context Parallelism for Production LLM Serving

Vertumnus is presented, an adaptive CP serving system designed for heterogeneous and evolving workloads that reduces mean TTFT and improves token-weighted SLO attainment and introduces a global prefix-cache management policy that coordinates cache placement and replication among workers with the same or different CP de...

Jiarui Guo, Rong-Le Wang, Pei-Jun Huang et al. · 0 citations
Book Open access Sep 2026

Unlocking Software-defined GPU Fabric Scheduling in the LLM Era

This study describes GPU-fabric contention in LLM workloads and presents GPUWeaver, a context-aware communication scheduler that monitors application progress and fabric state, identifies contention, and dynamically regulates communication injection according to application performance goals.

Dan-Yang Chen, Yu-Feng Gu, Yi-Bo Huang et al. · 2 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.