Skip to content

ReStore-in-Action: Adaptive Multi-Tier Storage Management via Intelligent Data Migration Policy

Aug 2026 · Proceedings of the VLDB Endowment · 0 citations · 13 references

TL;DR

ReStore is presented, a lightweight, page-level Reinforcement Learning-based migration policy that adaptively optimizes data placement by considering both workload and storage device characteristics and achieves up to 6× lower runtime and 48× fewer migrations compared to state-of-the-art baselines.

Abstract

Modern data systems employ a diverse range of storage devices, from high-performance, expensive SSDs to capacity-oriented SSDs and cost-effective, high-capacity HDDs. To leverage these varying characteristics, storage devices are often organized into Multi-Tiered Storage (MTS) systems. In MTS, data placement must be dynamic to align with evolving workload patterns through a migration policy that continuously upgrades or downgrades pages between tiers. However, managing these movements is challenging, as traditional rule-based methods often lack the flexibility to handle complex workloads and fail to account for hardware-specific properties, such as SSD read-write asymmetry and internal parallelism. To address these limitations, we recently presented ReStore, a lightweight, page-level Reinforcement Learning-based migration policy that adaptively optimizes data placement by considering both workload and storage device characteristics. Experimental results using industry-grade benchmarks and reallife traces show that ReStore achieves up to 6× lower runtime and 48× fewer migrations compared to state-of-the-art baselines. In this demonstration, we present a web simulation of an MTS where we integrate ReStore along with five other baseline policies. The conference participants can configure storage tier properties, generate custom workloads, and observe ReStore's realtime behavior (data placement and migration between tiers) alongside the baseline approaches. The demonstration is available at: https://disc-projects.bu.edu/ReStore/research.html.

View source

Similar papers

Book Open access Sep 2026

MEDO: Adaptive Multi-Stream Data Offloading for Efficient Management of Disaggregated Memory Pool

MEDO leverages a novel multi-stream data offloading architecture, featuring parallel data streams and approximate LRU queues, to maximize throughput and efficiently handle diverse workloads and incorporates a lightweight, adaptive offloading agent that dynamically optimizes data placement decisions and fine-grained sys...

Jing Wang, Han-Zhang Yang, Chao Li et al. · 0 citations
Book Open access Sep 2026

RLSM: A Disaggregated LSM-Based Key-Value Store with Resource-Aware Compaction

LSM-based storage engines are increasingly deployed in cloud storage systems and are moving toward disaggregated architectures. When compute and storage resources are separated, LSM compaction becomes a cross-node resource-control problem. Compute-side compaction can generate heavy RDMA network traffic when fetching re...

Zhiyuan Lou, Guo-Li Wei, Qing-Yang Zhang et al. · 0 citations
Preprint Oct 2026

IAPRepair: In-Network Aggregation Enhanced Proactive Repair for Erasure-Coded Storage System

Erasure-coded storage provides fault tolerance with substantially lower storage overhead than full replication, but repairing lost or at-risk blocks requires intensive cross-node data transfer. Existing reactive repair schemes start only after a failure, while proactive schemes can move data before failure but commonly...

Lei Liu, Yong Wang, Jun-Qi Chen et al. · 0 citations
Open access Aug 2026

HARMONI: Heterogeneity-Aware I/O Scheduling for Mixed Workloads in SSD-Based HPC Systems

Experimental results across diverse HPC and AI workloads demonstrate that HARMONI significantly reduces average makespan by up to 90% compared to state-of-the-art schedulers, effectively bridging the gap between evolving storage hardware and the dynamic I/O demands of modern HPC systems.

Ze-Xi Cai, Tong Zhao, Shadi Ibrahim et al. · 0 citations
Open access Sep 2026

Lightweight Cache Buffer Management and Data Allocation Strategy for Enhancing Read/Write Latency in SSDs

A Lightweight Cache Buffer Management (LCBM) strategy that avoids precise frequency tracking altogether and reduces the average read latency and the write response time, while eliminating the metadata overhead of counter- and LRU-based designs is introduced.

Li-Lung Hsieh, Qi-Cheng Wu, Yu-Pei Liang · 0 citations

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