Pith. sign in

REVIEW 2 cited by

Energy-Aware CPU Orchestration in O-RAN: A dApp-Driven Lightweight Approach

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 2508.00629 v1 pith:O6D2MNG4 submitted 2025-08-01 cs.NI cs.OScs.PF

Energy-Aware CPU Orchestration in O-RAN: A dApp-Driven Lightweight Approach

classification cs.NI cs.OScs.PF
keywords o-ranaccessdappdistributedenergyintroduceslightweightnetworks
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

The transition toward softwarized Radio Access Networks (RANs), driven by the Open RAN (O-RAN) paradigm, enables flexible, vendor-neutral deployments through disaggregation and virtualization of base station functions. However, this shift introduces new challenges in managing CPU resources efficiently under strict real-time constraints. In particular, the interplay between latency-sensitive RAN workloads and general-purpose Operating System (OS) schedulers often leads to sub-optimal performance and unnecessary energy consumption. This work proposes a lightweight, programmable distributed application (dApp) deployed at the Distributed Unit (DU) level to dynamically orchestrate CPU usage. The dApp operates in closed loop with the OS, leveraging thread-level telemetry like context switches, Instructions Per Cycle (IPC), and cache metrics, to adapt CPU thread affinity, core isolation, and frequency scaling in real time. Unlike existing solutions, it requires no access to proprietary RAN software, hardware-specific features, or kernel modifications. Fully compliant with the O-RAN architecture and agnostic to the underlying RAN stack, the proposed solution introduces negligible overhead while improving energy efficiency and CPU utilization. Experimental results using a commercial-grade srsRAN deployment demonstrate consistent power savings without compromising real-time processing performance, highlighting the potential of low-latency dApps for fine-grained resource control in next-generation networks

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. Programmable and GPU-Accelerated Edge Inference for Real-Time ISAC on NVIDIA Aerial Testbed

    cs.NI 2025-12 accept novelty 7.0

    A programmable GPU-accelerated framework for real-time AI on 5G edge RAN enables ISAC applications, with cuSense demonstrating 77 cm mean localization error using existing uplink signals on a compliant deployment.

  2. Energy-Latency Trade-offs in O-RAN with Distributed Baseband Processing and AI Inference

    cs.NI 2026-08 conditional novelty 6.0

    An O-RAN model with AI inference costs shows edge processing minimizes latency at higher energy, centralized processing minimizes energy at higher latency, and an energy budget picks the mix.