Skip to content
Preprint

A Bounded Reclaim Actuator for PSI-Guided Compressed Memory: A Controlled Ablation

Aug 2026 · 0 citations · 19 references
Computer Science

TL;DR

The results suggest that the benefit of zram enabled only after PSI indicates memory pressure depends on the foreground workload and its memory-access path, rather than a general improvement across workloads.

Abstract

When the aggregate working set of active processes exceeds physical RAM capacity, the machine experiences memory pressure. Applications may therefore slow down before the kernel kills a process. Linux provides several ways to observe and respond: Pressure Stall Information (PSI) can detect memory-related task stalls, zram can provide compressed in-memory swap space, and cgroup v2 can request memory reclamation within a selected control group. These facilities are often discussed together even though they act at different points in the pressure path. This paper examines that distinction with a controlled systems study. We compare three setups: zram enabled from startup; zram enabled only after PSI indicates memory pressure; and zram enabled from startup with a one-time 96 MiB cgroup reclaim request. We first selected the request size in a 16-case pilot, then ran 180 confirmatory cases, 60 cases for each setup, on nine 1-vCPU Linux virtual machines with compute and SQLite workloads. Compared with static zram, the bounded reclaim configuration reduced compute p99 response time by 6\%, while the SQLite result was statistically indistinguishable. Delayed activation had higher median p99 latency than both alternatives. These results suggest that the benefit depends on the foreground workload and its memory-access path, rather than a general improvement across workloads.

View source

Similar papers

Review Aug 2026

Concurrency Response of Plain Global Loads on the NVIDIA H100

The main result concerns the plain-load path: attained LDG bandwidth peaks at a small offered per-thread load (K ~ 2) and then declines, by about 35% from K=2 to K=8 at the authors' primary configuration.

S. Manjunath, Rahul Ramachandra · 0 citations
Book Open access Sep 2026

MCSched: Memory-Controller-Aware Scheduling for Embodied LLM Workloads on NVIDIA Jetson

Preliminary but compelling evidence that MC-aware scheduling is a practical operating system/runtime direction for deployable embodied AI on unified memory edge devices is provided.

Teng Mei, Cheng-Xuan Pei, Marco Canini et al. · 1 citation
Book Open access Sep 2026

Pinning Isn't Enough: Gang-Scheduling Memory-Model Litmus Tests with sched_ext

Litmus tests are the empirical workhorse for characterizing hardware memory models: small concurrent programs whose “weak” outcomes reveal how a processor reorders memory accesses. Their effectiveness hinges on a property the test cannot control on its own: its threads must execute simultaneously on different cores, wi...

Ali Siddiqui, Xiao-Guang Wang · 0 citations
#machine learning Preprint Sep 2026

mzCache: On-Device LLM Memory Management under Multitasking

On-device mobile Large Language Model (LLM) inference is gaining significant attention. However, mobile devices operate in highly dynamic multitasking environments where users frequently switch between applications. This creates memory pressure, forcing LLM memory (model weights and KV cache) to be evicted by the opera...

Hong Yu, Minsung Kim, Jongseok Park et al. · 0 citations
Open access Oct 2026

Page faults minimization for virtual memory systems using working set strategy

The classical working set (WS) model limits thrashing by keeping in memory all pages referenced within a fixed window delta. However, a constant delta cannot adapt to changing locality across execution phases, leading to either inefficient memory utilization or increased page faults. This paper treats delta as a contro...

Aigul Tungatarova, A. Murzakhmetov, G. Borankulova et al. · 0 citations

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