mlsanityData to 7 Oct 2026

Sibyl: Adaptive and Extensible Data Placement in Hybrid Storage Systems Using Online Reinforcement Learning

arXiv 2205.07394 ↗First posted 15 May 2022cs.AR cs.AI cs.DCcited by 8

Not on the map. Why?

Abstract (arXiv)

Hybrid storage systems (HSS) use multiple different storage devices to provide high and scalable storage capacity at high performance. Recent research proposes various techniques that aim to accurately identify performance-critical data to place it in a "best-fit" storage device. Unfortunately, most of these techniques are rigid, which (1) limits their adaptivity to perform well for a wide range of workloads and storage device configurations, and (2) makes it difficult for designers to extend these techniques to different storage system configurations (e.g., with a different number or different types of storage devices) than the configuration they are designed for. We introduce Sibyl, the first technique that uses reinforcement learning for data placement in hybrid storage systems. Sibyl observes different features of the running workload as well as the storage devices to make system-aware data placement decisions. For every decision it makes, Sibyl receives a reward from the system that it uses to evaluate the long-term performance impact of its decision and continuously optimizes its data placement policy online. We implement Sibyl on real systems with various HSS configurations. Our results show that Sibyl provides 21.6%/19.9% performance improvement in a performance-oriented/cost-oriented HSS configuration compared to the best previous data placement technique. Our evaluation using an HSS configuration with three different storage devices shows that Sibyl outperforms the state-of-the-art data placement policy by 23.9%-48.2%, while significantly reducing the system architect's burden in designing a data placement mechanism that can simultaneously incorporate three storage devices. We show that Sibyl achieves 80% of the performance of an oracle policy that has complete knowledge of future access patterns while incurring a very modest storage overhead of only 124.4 KiB.

Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). Builds on 16 of its 188 references that are in the map. First posted on arXiv 15 May 2022.

Builds on

16 of 188 references.

References · 16

  1. 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
  2. 2017A Distributional Perspective on Reinforcement Learningcited by 743
  3. 2018Programmatically Interpretable Reinforcement Learningcited by 192
  4. 2019Explainable Reinforcement Learning Through a Causal Lenscited by 177
  5. 2020Explainable Reinforcement Learning: A Surveycited by 139
  6. 2020Hyperparameter Selection for Offline Reinforcement Learningcited by 113
  7. 2020Chip Placement with Deep Reinforcement Learningcited by 83
  8. 2016Why Deep Neural Networks for Function Approximation?cited by 82
  9. 2018Toward Interpretable Deep Reinforcement Learning with Linear Model U-Treescited by 65
  10. 2019Interestingness Elements for Explainable Reinforcement Learning: Understanding Agents' Capabilities and Limitationscited by 50
  11. 2020An Imitation Learning Approach for Cache Replacementcited by 24
  12. 2021Pythia: A Customizable Hardware Prefetching Framework Using Online Reinforcement Learningcited by 17
4 more
  1. 2017Error Characterization, Mitigation, and Recovery in Flash Memory Based Solid-State Drivescited by 9
  2. 2021Data-driven battery operation for energy arbitrage using rainbow deep reinforcement learningcited by 9
  3. 2020Intelligent Architectures for Intelligent Computing Systemscited by 5
  4. 2021Reducing Solid-State Drive Read Latency by Optimizing Read-Retrycited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 1; 2024: 2; 2025: 2; 2026: 2.

8 papers.