Deterministic Addressing Engine (MED): Eliminating Storage Stack Overhead to Minimize Read Amplification and Energy per Useful Bit in NVMe-Based Systems

Modern data-intensive workloads, including High-Frequency Trading (HFT) order books and Large Language Model (LLM) KV-caches, suffer from severe tail latency (p99) and energy inefficiency due to deep storage software stacks. Even when retrieving sub-kilobyte payloads, conventional architectures traverse B-trees, OS page caches, and 4 KB block abstractions, incurring a 64× bus read amplification for 64-byte payloads and delegating physical placement to opaque Flash Translation Layers (FTL). This paper proposes the Deterministic Addressing Engine (MED), a user-space storage architecture that replaces index-based lookups with direct mathematical offset computation (O(1)). By combining bounded-load Cuckoo Hashing (α≤0.80), kernel-bypass I/O via SPDK, and NVMe Zoned Namespaces (ZNS), MED maps keys directly to physical device offsets without internal FTL remapping. We formalize the bus amplification and energy-per-bit model (pJ/bit) and establish a two-phase validation methodology targeting order-of-magnitude reductions in p99 latency and data-movement energy.

Authors

Institutions

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-11-17
DOI
https://doi.org/10.5281/zenodo.24318134
Primary Topic
Advanced Data Storage Technologies
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

Deterministic Addressing Engine (MED): Eliminating Storage Stack Overhead to Minimize Read Amplification and Energy per Useful Bit in NVMe-Based Systems

Eriberto da Silva de Araújo
Zenodo (CERN European Organization for Nuclear Research)
Advanced Data Storage Technologies
preprint

Deterministic Addressing Engine (MED): Eliminating Storage Stack Overhead to Minimize Read Amplification and Energy per Useful Bit in NVMe-Based Systems

Eriberto da Silva de Araújo
preprint en

Abstract

Modern data-intensive workloads, including High-Frequency Trading (HFT) order books and Large Language Model (LLM) KV-caches, suffer from severe tail latency (p99) and energy inefficiency due to deep storage software stacks. Even when retrieving sub-kilobyte payloads, conventional architectures traverse B-trees, OS page caches, and 4 KB block abstractions, incurring a 64× bus read amplification for 64-byte payloads and delegating physical placement to opaque Flash Translation Layers (FTL). This paper proposes the Deterministic Addressing Engine (MED), a user-space storage architecture that replaces index-based lookups with direct mathematical offset computation (O(1)). By combining bounded-load Cuckoo Hashing (α≤0.80), kernel-bypass I/O via SPDK, and NVMe Zoned Namespaces (ZNS), MED maps keys directly to physical device offsets without internal FTL remapping. We formalize the bus amplification and energy-per-bit model (pJ/bit) and establish a two-phase validation methodology targeting order-of-magnitude reductions in p99 latency and data-movement energy.

Zenodo (CERN European Organization for Nuclear Research)
Instituto Federal de Educação Ciência e Tecnologia do Mato Grosso do Sul (BR)
Advanced Data Storage Technologies
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon