mlsanityData to 14 Oct 2026

Harmonia: Enhancing Data Placement and Migration in Hybrid Storage Systems via Multi-Agent Reinforcement Learning

arXiv 2503.20507 ↗First posted 26 Mar 2025cs.AR cs.DC cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Modern high-performance computing (HPC) environments rely on hybrid storage systems (HSS) that combine multiple storage devices with diverse latency, bandwidth, endurance, and capacity characteristics to meet the performance, capacity, and cost requirements of data-intensive applications. The performance of an HSS highly depends on two key data-management policies: (1) data placement, which determines the most suitable storage device to store application data, and (2) data migration, which dynamically reorganizes previously-stored data across storage devices (i.e., prefetching hot data and evicting cold data) to sustain high HSS performance. These policies are tightly interdependent, and thus, improving one without considering the other leads to suboptimal HSS performance. Unfortunately, prior works focus on optimizing only one of the policies. Our goal is to design a holistic data-management technique that optimizes both data-placement and data-migration policies to fully exploit the potential of an HSS. To this end, we propose Harmonia, a multi-agent reinforcement learning (RL)-based data-management technique. Harmonia employs two lightweight autonomous RL agents, a data-placement agent and a data-migration agent, that adapt their policies for the current workload and HSS configuration while coordinating with each other. We evaluate Harmonia on real HSS configurations with up to four heterogeneous storage devices and 25 data-intensive workloads. On a performance- (cost-) optimized HSS with two heterogeneous storage devices, Harmonia outperforms the best-performing prior approach by 29.3% (44.8%) on average. On an HSS with three (four) devices, Harmonia outperforms the best-performing prior work by 38.9% (39.2%) on average. Harmonia's performance benefits come with low latency (240 ns for inference) and storage (206 KiB in DRAM for both RL agents combined) overheads.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 43 of its 306 references that are in the map. First posted on arXiv 26 Mar 2025.

Builds on

43 of 306 references.

References · 43

  1. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  3. 2014Sequence to Sequence Learning with Neural Networkscited by 2,986
  4. 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,512
  5. 2017A Distributional Perspective on Reinforcement Learningcited by 765
  6. 2023FlexGen: High-Throughput Generative Inference of Large Language Models with a Single GPUcited by 575
  7. 2019Deep Learning Recommendation Model for Personalization and Recommendation Systemscited by 327
  8. 2017Distral: Robust Multitask Reinforcement Learningcited by 233
  9. 2023PowerInfer: Fast Large Language Model Serving with a Consumer-grade GPUcited by 217
  10. 2019AdaShare: Learning What To Share For Efficient Deep Multi-Task Learningcited by 160
  11. 2020Multi-Task Reinforcement Learning with Soft Modularizationcited by 143
  12. 2018Learning Scheduling Algorithms for Data Processing Clusterscited by 134
31 more
  1. 2020Hyperparameter Selection for Offline Reinforcement Learningcited by 114
  2. 2020Chip Placement with Deep Reinforcement Learningcited by 83
  3. 2019PUMA: A Programmable Ultra-efficient Memristor-based Accelerator for Machine Learning Inferencecited by 61
  4. 2020FIRM: An Intelligent Fine-Grained Resource Management Framework for SLO-Oriented Microservicescited by 41
  5. 2020A Survey on Large-scale Machine Learningcited by 35
  6. 2020An Imitation Learning Approach for Cache Replacementcited by 24
  7. 2021Google Neural Network Models for Edge Devices: Analyzing and Mitigating Machine Learning Inference Bottleneckscited by 23
  8. 2025PIM Is All You Need: A CXL-Enabled GPU-Free System for Large Language Model Inferencecited by 22
  9. 2025PAPI: Exploiting Dynamic Parallelism in Large Language Model Decoding with a Processing-In-Memory-Enabled Computing Systemcited by 20
  10. 2017GraphR: Accelerating Graph Processing Using ReRAMcited by 19
  11. 2024InstInfer: In-Storage Attention Offloading for Cost-Effective Long-Context LLM Inferencecited by 19
  12. 2021Pythia: A Customizable Hardware Prefetching Framework Using Online Reinforcement Learningcited by 18
  13. 2024Cambricon-LLM: A Chiplet-Based Hybrid Architecture for On-Device Inference of 70B LLMcited by 18
  14. 2021SISA: Set-Centric Instruction Set Architecture for Graph Mining on Processing-in-Memory Systemscited by 17
  15. 2024DataStates-LLM: Lazy Asynchronous Checkpointing for Large Language Modelscited by 16
  16. 2017GRIM-Filter: Fast Seed Location Filtering in DNA Read Mapping Using Processing-in-Memory Technologiescited by 11
  17. 2017Error Characterization, Mitigation, and Recovery in Flash Memory Based Solid-State Drivescited by 10
  18. 2022TPP: Transparent Page Placement for CXL-Enabled Tiered-Memorycited by 10
  19. 2020GenASM: A High-Performance, Low-Power Approximate String Matching Acceleration Framework for Genome Sequence Analysiscited by 9
  20. 2021Data-driven battery operation for energy arbitrage using rainbow deep reinforcement learningcited by 9
  21. 2024MegIS: High-Performance, Energy-Efficient, and Low-Cost Metagenomic Analysis with In-Storage Processingcited by 5
  22. 2016GateKeeper: A New Hardware Architecture for Accelerating Pre-Alignment in DNA Short Read Mappingcited by 4
  23. 2018Read Disturb Errors in MLC NAND Flash Memorycited by 4
  24. 2022Machine Learning Training on a Real Processing-in-Memory Systemcited by 4
  25. 2025A Cost-Effective Near-Storage Processing Solution for Offline Inference of Long-Context LLMscited by 4
  26. 2021Reducing Solid-State Drive Read Latency by Optimizing Read-Retrycited by 3
  27. 2022GenPIP: In-Memory Acceleration of Genome Analysis via Tight Integration of Basecalling and Read Mappingcited by 3
  28. 2017Errors in Flash-Memory-Based Solid-State Drives: Analysis, Mitigation, and Recoverycited by 2
  29. 2018Improving 3D NAND Flash Memory Lifetime by Tolerating Early Retention Loss and Process Variationcited by 2
  30. 2023Venice: Improving Solid-State Drive Parallelism at Low Cost via Conflict-Free Accessescited by 2
  31. 2017Banshee: Bandwidth-Efficient DRAM Caching Via Software/Hardware Cooperationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2024Dynamic Optimization of Storage Systems Using Reinforcement Learning Techniques
  2. 2026Machine Learning-Driven Intelligent Memory System Design: From On-Chip Caches to Storage
  3. 2025StorageXTuner: An LLM Agent-Driven Automatic Tuning Framework for Heterogeneous Storage Systems
  4. 2025Multi-Agent Reinforcement Learning for Adaptive Resource Orchestration in Cloud-Native Clusters
  5. 2024SustainDC: Benchmarking for Sustainable Data Center Control
  6. 2024Towards using Reinforcement Learning for Scaling and Data Replication in Cloud Systems
  7. 2025Hierarchical Multi-Agent Framework for Carbon-Efficient Liquid-Cooled Data Center Clusters
  8. 2025Enhancing Diversity in Parallel Agents: A Maximum State Entropy Exploration Story