Skip to content

Valinor: Architectural Support for Fast, Energy-Efficient and Programmable Physical Memory Allocation

Jul 2026 · arXiv.org · Vol abs/2607.14789 · 0 citations
Computer Science

TL;DR

Vinor is presented, a hardware-OS cooperative memory allocation substrate that combines software flexibility with hardware-class performance and full-system simulation further evaluates the programmable allocation engine and six allocation libraries, showing that Valinor provides hardware-class performance without sacrificing programmability.

Abstract

Physical memory allocation establishes virtual-to-physical mappings on demand. In current systems, each minor page fault traps into the kernel and triggers pipeline flushes, stalls, and a long sequence of allocation steps that can cost tens of thousands of cycles. These overheads are increasingly significant for short-lived workloads such as serverless functions and microservices, where minor faults can account for up to 54% of runtime and up to 40% of system energy. Prior hardware allocation proposals avoid traps and context switches, but either sacrifice useful placement optimizations or rely on fixed-function logic that cannot adapt to new policies or changing hardware conditions. We present Valinor, a hardware-OS cooperative memory allocation substrate that combines software flexibility with hardware-class performance. Valinor introduces a programmable hardware allocation engine that executes compact OS-supplied allocation libraries at close to fixed-hardware speed. It supports diverse policies, including short-lived object allocators, integrity mechanisms, and hardware-telemetry-guided placement. We implement Valinor on a BOOM RISC-V soft core running Linux and in a full-system simulator. On real hardware, Valinor accelerates allocation by 17x, improves end-to-end performance by 16%, and reduces energy consumption by up to 8%. Full-system simulation further evaluates the programmable allocation engine and six allocation libraries, showing that Valinor provides hardware-class performance without sacrificing programmability.

View source

Similar papers

Open access Sep 2026

Packets are Not Pages: Flow-Based Addressing Conserves Memory Bandwidth

This work proposes a new memory addressing scheme, flow-based addressing, which enables software to access the reassembled payloads of a flow's packets as a contiguous region in memory, and shows that it reduces DRAM bandwidth use, lowers execution time, and increases per-core throughput.

Agur Adams, H. Shim, Colin Drewes et al. · 0 citations

HostPIMSim: A High-Productivity Framework for Host-Side Processing-in-Memory Simulation

Results show that standardizing the host-interface layer reduces both the engineering cost of PIM simulator development and the energy overhead of simulation-driven workload evaluation, while reducing host CPU utilization and package energy by up to 50% on transfer-intensive workloads.

Jinyong Min, Bernhard Egger · 0 citations
Preprint Aug 2026

MEMPOWER: Efficient Power Management with Fine-grained Memory Analysis and Modeling for HPC Workloads

MEPOWER is proposed, a flexible, model-based approach to exposing compute/data movement imbalance that characterizes the fine-grained memory behavior of parallel workloads that demonstrates a reduction in EDP on a range of HPC benchmarks with minimal impact on execution time when compared to the standard OS/hardware-ma...

Nanda Velugoti, Joseph Manzano, Andrés Márquez et al. · 0 citations
Book Open access Sep 2026

Lost Bytes At The Crossroads Between User-And Kernel-Level Memory Management

It is shown that—since the kernel manages memory at page-granularity—the user-level allocation scheme must be designed with page alignment in mind, and a classification for physical memory that is lost due to the mismatch of user-space and kernel-space allocation granularities is provided.

Pasha Fistanto, Sören Tempel, Christian Dietrich · 0 citations
Open access Sep 2026

VCSRT extended page table assisted virtual memory mapping framework for efficient dynamic resource allocation in industrial edge virtualized runtimes

Experimental results validate that VCSRT achieves substantial reductions in worst-case allocation latency and worst-case execution time of high-priority tasks under heavy load, and maintains microsecond-level response jitter stability across all load levels.

Xin-Kai Zhang, W. Dai · 0 citations
Preprint Aug 2026

Memory Allocation for Constant-Bounded Programs

This work shows that constant boundedness enables a tight, polynomial-time approximation of optimal stack usage by viewing control flow as a tree and applying a tree-scan allocation strategy augmented with memory defragmentation, and guarantees memory usage bounded by the maximum live memory plus, at most, the size of...

V. Silva, Kael Soares, M. Pereira · 0 citations

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