DALdex: A DPU-Accelerated Persistent Learned Index via Incremental Learning

The Data Process Unit (DPU) specializes in offloading CPUintensive tasks and provides efficient fault tolerance through hardware-level isolation.This brings unique opportunities to develop persistent indexes with high performance and availability in High Performance Computing (HPC) systems.The recent learned index exploits machine learning models to efficiently fit data distributions, exhibiting superior performance and low storage costs, which is a promising alternative to traditional tree-based range indexes.However, state-of-the-art persistent learned indexes suffer from costly model retrainings and inefficient recovery mechanisms based on Non-Volatile Memory (NVM), making them inefficient to be offloaded to DPUs.To address these challenges, we propose DALdex, a CPU-DPU hybrid persistent learned index with high performance and availability.To mitigate model retraining overheads, DALdex offloads retraining tasks to DPU based on the incremental learning scheme.To minimize NVM amplifications, DALdex designs an NVM-friendly index structure that is decoupled into a DRAM-accelerated model layer and an NVM-aware block layer.Moreover, DALdex utilizes the hardware isolation feature of DPU to achieve seamless failover and instant recovery via the PCIe bus.Extensive evaluation results demonstrate that DALdex outperforms state-of-theart persistent indexes by 1.07-6.34with minimal DRAM and NVM overheads.

Authors

Institutions

Publication Details

Published
2025-06-08
DOI
https://doi.org/10.1145/3721145.3725750
Citations
2
Primary Topic
Face and Expression Recognition
Type
article
Field-Weighted Citation Impact
2.55

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DALdex: A DPU-Accelerated Persistent Learned Index via Incremental Learning

Menglei Chen, Yu Hua, Aili Tong
2 citations
Face and Expression Recognition
2.55
article

DALdex: A DPU-Accelerated Persistent Learned Index via Incremental Learning

Menglei Chen, Yu Hua, Aili Tong
article en
2 citations

Abstract

The Data Process Unit (DPU) specializes in offloading CPUintensive tasks and provides efficient fault tolerance through hardware-level isolation.This brings unique opportunities to develop persistent indexes with high performance and availability in High Performance Computing (HPC) systems.The recent learned index exploits machine learning models to efficiently fit data distributions, exhibiting superior performance and low storage costs, which is a promising alternative to traditional tree-based range indexes.However, state-of-the-art persistent learned indexes suffer from costly model retrainings and inefficient recovery mechanisms based on Non-Volatile Memory (NVM), making them inefficient to be offloaded to DPUs.To address these challenges, we propose DALdex, a CPU-DPU hybrid persistent learned index with high performance and availability.To mitigate model retraining overheads, DALdex offloads retraining tasks to DPU based on the incremental learning scheme.To minimize NVM amplifications, DALdex designs an NVM-friendly index structure that is decoupled into a DRAM-accelerated model layer and an NVM-aware block layer.Moreover, DALdex utilizes the hardware isolation feature of DPU to achieve seamless failover and instant recovery via the PCIe bus.Extensive evaluation results demonstrate that DALdex outperforms state-of-theart persistent indexes by 1.07-6.34with minimal DRAM and NVM overheads.

Huazhong University of Science and Technology (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 9%
Face and Expression Recognition
2.55
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.