Skip to content
Conference

BRUMM: A Case for Predictable Memory Reclamation

2026 · Euromicro Conference on Real-Time Systems · pp. 15:1-15:24 · 0 citations · 34 references
Computer Science

TL;DR

Bounded Reclamation of User-space Memory Mappings makes reclamation latency a first-class resource that can be accounted for, thereby improving isolation and reliability in edge clouds.

View source

Similar papers

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

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

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.

Abhiyan Dhakal, Sanjog Sigdel · 0 citations
Open access 2026

Supporting Memory Safety with a Security-Enhanced Memory Controller

SerMC is proposed, a memory-controller-based tripwire mechanism that validates accesses when metadata arrives from Dynamic Random Access Memory and extends enforcement to DRAM-bound accesses issued by both processors and DMA-capable devices, and provides practical average-case overhead but still exposes a clear worst-c...

Gen Xu, Li Lv, Jiayan Dong · 0 citations

of the 24th USENIX Conference on File and Storage Technologies

SolidAttention is introduced, an LLM inference engine which addresses limitations through a tight co-design of dynamic attention sparsity algorithms and SSD-based storage management and minimizes SSD-induced blocking latency.

Xin Zheng, Dong-Liang Wei, Jian-Xiang Gao et al. · 0 citations
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

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