A Parametric I/O Model for Modern Storage Devices

被引:5
|
作者
Papon, Tarikul Islam [1 ]
Athanassoulis, Manos [1 ]
机构
[1] Boston Univ, Boston, MA 02215 USA
来源
17TH INTERNATIONAL WORKSHOP ON DATA MANAGEMENT ON NEW HARDWARE, DAMON 2021 | 2021年
基金
美国国家科学基金会;
关键词
EXPLOITING INTERNAL PARALLELISM; PERFORMANCE; MEMORY; TREES; B+;
D O I
10.1145/3465998.3466003
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Storage devices have evolved to offer increasingly faster read/write access, through flash-based and other solid-state storage technologies. When compared to classical rotating hard disk drives (HDDs), modern solid-state drives (SSDs) have two key differences: (i) the absence of mechanical parts, and (ii) an inherent difference between the process of reading and writing. The former removes a key performance bottleneck, enabling internal device parallelism, whereas the latter manifests as a read/write performance asymmetry. In other words, SSDs can serve multiple concurrent I/Os, and their writes are generally slower than reads; none of which is true for HDDs. Yet, the performance of storage-resident applications is typically modeled by the number of disk accesses performed, inherently assuming symmetric read and write performance and the ability to perform only one I/O at a time, failing to accurately capture the performance of modern storage devices. To address this mismatch, we propose a simple yet expressive storage model, termed Parametric I/O Model (PIO) that captures contemporary devices by parameterizing read/write asymmetry (alpha) and access concurrency (k). PIO enables device-specific decisions at algorithm design time, rather than as an optimization during deployment and testing, thus ensuring optimal algorithm design by taking into account the properties of each device. We present a benchmarking of several storage devices that shows that a and k vary significantly across devices. Further, we show that using carefully quantified values of alpha and k for each storage device, we can fully exploit the performance it offers, and we lay the groundwork for asymmetry/concurrency-aware storage-intensive algorithms. We also highlight that the degree of the performance benefit due to concurrent reads or writes depends on the asymmetry of the underlying device. Finally, we summarize our findings as a set of guidelines for designing storage-intensive algorithms and discuss specific examples for better algorithm and system designs as well as runtime tuning.
引用
收藏
页数:11
相关论文
共 50 条
  • [1] Optimizing the Block I/O Subsystem for Fast Storage Devices
    Yu, Young Jin
    Shin, Dong In
    Shin, Woong
    Song, Nae Young
    Choi, Jae Woo
    Kim, Hyeong Seog
    Eom, Hyeonsang
    Yeom, Heon Young
    ACM TRANSACTIONS ON COMPUTER SYSTEMS, 2014, 32 (02):
  • [2] Optimizing I/O Operations in File Systems for Fast Storage Devices
    Son, Yongseok
    Yeom, Heon Young
    Han, Hyuck
    IEEE TRANSACTIONS ON COMPUTERS, 2017, 66 (06) : 1071 - 1084
  • [3] User-Space I/O for μs-level Storage Devices
    Papagiannis, Anastasios
    Saloustros, Giorgos
    Marazakis, Manolis
    Bilas, Angelos
    HIGH PERFORMANCE COMPUTING, ISC HIGH PERFORMANCE 2016 INTERNATIONAL WORKSHOPS, 2016, 9945 : 638 - 648
  • [4] Iris: An optimized I/O stack for low-latency storage devices
    Papagiannis, Anastasios
    Saloustros, Giorgos
    Marazakis, Manolis
    Bilas, Angelos
    OPERATING SYSTEMS REVIEW, 2016, 50 (02) : 3 - 11
  • [5] The Storage Hierarchy is Not a Hierarchy: Optimizing Caching on Modern Storage Devices with Orthus
    Wu, Kan
    Guo, Zhihan
    Hu, Guanzhou
    Tu, Kaiwei
    Alagappan, Ramnatthan
    Sen, Rathijit
    Park, Kwanghyun
    Arpaci-Dusseau, Andrea C.
    Arpaci-Dusseau, Remzi H.
    PROCEEDINGS OF THE 19TH USENIX CONFERENCE ON FILE AND STORAGE TECHNOLOGIES (FAST '21), 2021, : 307 - 323
  • [6] Spatial Index Structures for Modern Storage Devices: A Survey
    Carniel, Anderson Chaves
    Aguiar, Cristina Dutra
    IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2023, 35 (09) : 9578 - 9597
  • [7] FragPicker: A New Defragmentation Tool for Modern Storage Devices
    Park, Jonggyu
    Eom, Young Ik
    PROCEEDINGS OF THE 28TH ACM SYMPOSIUM ON OPERATING SYSTEMS PRINCIPLES, SOSP 2021, 2021, : 280 - 294
  • [8] Reducing Bloom Filter CPU Overhead in LSM-Trees on Modern Storage Devices
    Zhu, Zichen
    Mun, Ju Hyoung
    Raman, Aneesh
    Athanassoulis, Manos
    17TH INTERNATIONAL WORKSHOP ON DATA MANAGEMENT ON NEW HARDWARE, DAMON 2021, 2021,
  • [9] A User-space Storage I/O Framework for NVMe SSDs in Mobile Smart Devices
    Kim, Hyeong-Jun
    Kim, Jin-Soo
    IEEE TRANSACTIONS ON CONSUMER ELECTRONICS, 2017, 63 (01) : 28 - 35
  • [10] Design and performance analysis of modern computational storage devices: A systematic review
    Shirke, Sushama Annaso
    Jayakumar, Naveenkumar
    Patil, Suhas
    EXPERT SYSTEMS WITH APPLICATIONS, 2024, 250