Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2610.23072

ScaleRAN: A Runtime for Elastic GPU Resource Management in AI-RAN

Arthur Hamard·Jérémie Leguay·Gopalasingham Aravinthan·Alberto Conte·Julien Lallet·Abdelkader Outtagarts
View original source ↗Read source document ↗Export metadata ↓

Abstract

AI-RAN is driving the convergence of radio access network (RAN) processing and artificial intelligence (AI) workloads on GPU-enabled computing platforms, ranging from GPU-accelerated base stations to cloud-native infrastructures. While GPU acceleration improves the efficiency of virtualized RAN functions, the computational demand of latency-critical baseband processing varies with traffic load, creating transient spare GPU capacity that can be reclaimed by co-located AI applications. Existing GPU-sharing mechanisms rely on coarse-grained hardware partitioning or static resource allocation, limiting their ability to adapt to slot-level workload fluctuations while preserving strict timing requirements. This paper presents ScaleRAN, a node-local runtime for elastic GPU resource management in AI-RAN. ScaleRAN leverages NVIDIA Green Contexts to dynamically partition Streaming Multiprocessors (SMs) between RAN and AI workloads through a ladder of pre-created GPU partitions, enabling low-overhead resource reallocation at RAN slot granularity. The proposed runtime naturally supports Open-RAN (O-RAN) O-Cloud deployments, one representative AI-RAN deployment scenario. To drive these reallocations, we propose a reactive controller inspired by Kubernetes autoscaling and a proactive controller based on quantile regression and conformal prediction. We also develop LDPCSim, a GPU-accelerated workload generator built on NVIDIA Aerial for reproducible evaluation. Results show that predictive fine-grained GPU partitioning satisfies slot-level RAN deadlines while increasing the GPU resources available to co-located AI workloads, demonstrating the practicality of elastic GPU sharing for future AI-RAN platforms.

Explore related subjects

cs.NIcs.DC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Arthur Hamard, Jérémie Leguay, Gopalasingham Aravinthan, Alberto Conte, Julien Lallet, Abdelkader Outtagarts. 2026-10-16. ScaleRAN: A Runtime for Elastic GPU Resource Management in AI-RAN. https://arxiv.org/abs/2610.23072

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Joint User Association and Resource Allocation for Adaptive Semantic Communication in 5G and Beyond Networks

Semantic communication (SemCom) has emerged as a promising paradigm that leverages Deep Neural Networks (DNNs) to extract task-relevant information, thereby substantially reducing the volume of transmitted data. In existing implementations, the semantic transceiver is typically pre-trained for a specific task and uniformly adopted by all users. However, due to user heterogeneity in computational and communication capabilities, employing a single, fixed semantic transceiver may degrade the coding efficiency and transmission robustness. To address this issue, we first demonstrate the feasibility of dynamically adjusting the computational and communication overhead of DNN-based semantic transceivers, enabling a more flexible paradigm referred to as Adaptive Semantic Communication (ASC). Building on this concept, we formulate a joint user association and resource allocation problem for ASC in 5G and beyond networks, aiming to maximize overall system utility under energy and latency constraints. However, the problem is very challenging due to the inherent interdependencies among decision variables. To tackle this complexity, we decompose the original problem into three subproblems: (i) ASC scheme selection for each user, (ii) spectrum allocation at each Small-cell Base Station (SBS), and (iii) user association across SBSs. Each subproblem is solved sequentially based on the solutions of the preceding stages. The proposed algorithm efficiently yields near-optimal solutions with polynomial-time complexity. Simulation results demonstrate our approach outperforms existing baselines under various situations.

cs.NI↗
arXiv2026

LLM-Guided Dual-Stage Latency Optimization for Closed-Loop 6G V2I Digital Twins

Wireless Digital Twins are emerging as a key enabler for predictive network control in 6G Vehicle-to-Infrastructure (V2I) systems. However, closed-loop V2I DTs face two dual-stage communication bottlenecks arising from model parameter exchange for V2I DT reconstruction and multi-service V2I traffic delivery after each reconstruction. This paper proposes a closed-loop dual-stage End-to-End (E2E) latency optimization framework that integrates Compressed Personalized Federated Learning with a unified Large-Language-Model-guided Multi-Agent Reinforcement Learning approach. A CPFL-enabled decision-oriented V2I DT is first constructed by jointly predicting Path Loss (PL) and Quality-of-Experience (QoE)-oriented Key Performance Indicators (KPIs). Then the framework comprises two temporally coupled but latency-wise distinct optimization stages: Stage I minimizes the joint Uplink (UL) and Downlink (DL) E2E transmission latency of compressed shared backbone's parameters, and Stage II minimizes the service-aware E2E latency of multi-service V2I traffic. As the two stages share aligned agent roles and action space, we develop a unified Semantic-Aware Guidance-Enhanced Multi-Agent Proximal Policy Optimization framework, in which the LLM acts as a training-time semantic planner that provides high-level traffic splitting and power allocation guidance to reduce inefficient exploration, while the MARL agents execute feasible low-level actions. Simulation results demonstrate that the proposed framework enables efficient V2I DT reconstruction and significantly reduces both E2E latency for DT reconstruction and multi-service V2I traffic. The proposed SAGE-MAPPO supports cross-stage policy reuse by sequentially solving the two stages within each DT update cycle, which accelerates convergence relative to the existing baselines and facilitates timely DT updates in dynamic V2I scenarios.

cs.NI↗
arXiv2026

Federated Multiagent Soft Actor Critic for IRS Assisted Cognitive Radio Networks under Partial Observability

Intelligent reflecting surfaces (IRSs) can improve spectrum efficiency and interference control in cognitive radio networks (CRNs) by reconfiguring the propagation environment. This paper presents FMASAC, a federated multi-agent soft actor-critic framework for IRS-assisted CRNs under partial observability, in which distributed secondary users (SUs) jointly select their transmit power and the phase shifts of an assigned subset of IRS elements using only local observations. Primary user (PU) protection is incorporated through an interference-penalized reward, and SUs coordinate by periodically averaging model parameters at a federated server, without exchanging raw observations, channel state information, or replay data. We formulate the problem as a partially observable Markov decision process, specify the local learning and aggregation procedure, and characterize its per-round communication cost. Illustrative performance trends contrast FMASAC with centralized SAC, independent SAC, IRS-fixed multi-agent reinforcement learning, and a heuristic CRN strategy. We also outline the simulation-based evaluation and the open challenges, namely constraint handling, agent heterogeneity, and scalability, that are needed to validate the framework.

cs.NI↗