SPOPB: Reducing solid state drive write traffic for flash-based key-value caching

被引:2
|
作者
Li, Zongwei [1 ]
Feng, Dan [1 ,2 ]
Hu, Yuchong [1 ,2 ]
Lu, Mengting [1 ]
机构
[1] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Wuhan 430074, Peoples R China
[2] Huazhong Univ Sci & Technol, Sch Comp Sci & Technol, Wuhan, Peoples R China
来源
SOFTWARE-PRACTICE & EXPERIENCE | 2022年 / 52卷 / 02期
基金
中国国家自然科学基金;
关键词
flash-based KV caching; slab popularity; SSD write traffic;
D O I
10.1002/spe.3050
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Flash-based key-value (KV) caching has received increasing attention in recent years with the advantages of flash-based solid state drives (SSDs) in capacity and cost. By caching most data in SSD, the caching system can eliminate lots of time-consuming requests to back-end data stores to provide low-latency services. To adapt to the unique technical constraints of flash memory, flash-based KV caching adopts a slab-based log-structured management scheme in which the slab is the basic storage unit, and uses a small memory space as a write buffer to eliminate small random writes to SSD for consistent performance and increased lifetime of SSD. However, we have observed that under update-intensive workloads with strong temporal locality, the slab-based management in flash-based KV caching introduces substantial SSD write traffic because of indistinguishable SSD flushing of hot items in slabs, which shortens the SSD lifetime and degrades the performance with increased erase operations. In this article, we first analyze the SSD write traffic in the flash-based KV caching, and then propose a novel slab popularity-based storage management scheme-SPOPB, to extend SSD lifetime and improve performance. Our scheme identifies hot items using a self-adaptive threshold to reorganize and classify slabs with both the hotness and size of items. Then SPOPB filters and retains the popular slabs containing hot items in the write buffer with redesigned replacement policy to reduce the SSD write traffic. Our experiments show that our design can effectively reduce the SSD write traffic by 63.6%, the erase counts by 55.6%, and improve the performance by 42%.
引用
收藏
页码:353 / 373
页数:21
相关论文
共 50 条
  • [41] A novel method for victim block selection for NAND flash-based solid state drives based on scoring
    Asal Khanbadr
    Mohammadreza Binesh Marvasti
    Seyyed Amir Asghari
    Sohrab Khanbadr
    Amir M. Rahmani
    The Journal of Supercomputing, 2020, 76 : 10186 - 10211
  • [42] A novel method for victim block selection for NAND flash-based solid state drives based on scoring
    Khanbadr, Asal
    Marvasti, Mohammadreza Binesh
    Asghari, Seyyed Amir
    Khanbadr, Sohrab
    Rahmani, Amir M.
    JOURNAL OF SUPERCOMPUTING, 2020, 76 (12): : 10186 - 10211
  • [43] Performance of garbage collection algorithms for flash-based solid state drives with hot/cold data
    Van Houdt, Benny
    PERFORMANCE EVALUATION, 2013, 70 (10) : 692 - 703
  • [44] A Cache Management Scheme for Hiding Garbage Collection Latency in Flash-based Solid State Drives
    Xie, Wei
    Chen, Yong
    2015 IEEE INTERNATIONAL CONFERENCE ON CLUSTER COMPUTING - CLUSTER 2015, 2015, : 486 - 487
  • [45] Design and Implementation of a Log-Structured File System for Flash-Based Solid State Drives
    Min, Changwoo
    Lee, Sang-Won
    Eom, Young Ik
    IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (09) : 2215 - 2227
  • [46] A mean field model for a class of garbage collection algorithms in flash-based solid state drives
    Van Houdt, Benny
    QUEUEING SYSTEMS, 2014, 77 (02) : 149 - 176
  • [47] A mean field model for a class of garbage collection algorithms in flash-based solid state drives
    Benny Van Houdt
    Queueing Systems, 2014, 77 : 149 - 176
  • [48] Re-aligning Across-page Requests for Flash-based Solid-state Drives
    Cai, Zhigang
    Tang, Chengyong
    Li, Minjun
    Trahay, Francois
    Li, Jun
    Sha, Zhibing
    Wu, Jiaojiao
    Yang, Fan
    Liao, Jianwei
    PROCEEDINGS OF THE 52ND INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, ICPP 2023, 2023, : 736 - 745
  • [49] B+-tree Index Optimization by Exploiting Internal Parallelism of Flash-based Solid State Drives
    Roh, Hongchan
    Park, Sanghyun
    Kim, Sungho
    Shin, Mincheol
    Lee, Sang-Won
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2011, 5 (04): : 286 - 297
  • [50] Exploiting Parallelism in I/O Scheduling for Access Conflict Minimization in Flash-based Solid State Drives
    Gao, Congming
    Shi, Liang
    Zhao, Mengying
    Xue, Chun Jason
    Wu, Kaijie
    Sha, Edwin H. -M.
    2014 30TH SYMPOSIUM ON MASSIVE STORAGE SYSTEMS AND TECHNOLOGIES (MSST), 2014,