High-Performance and Lightweight Transaction Support in Flash-Based SSDs

被引:11
|
作者
Lu, Youyou [1 ]
Shu, Jiwu [1 ]
Guo, Jia [1 ]
Li, Shuai [1 ]
Mutlu, Onur [2 ]
机构
[1] Tsinghua Univ, Dept Comp Sci & Technol, Beijing 100084, Peoples R China
[2] Carnegie Mellon Univ, Pittsburgh, PA 15213 USA
基金
美国国家科学基金会; 中国国家自然科学基金; 国家高技术研究发展计划(863计划);
关键词
Solid state drives; flash memory; transaction recovery; transactional SSD; atomicity; durability;
D O I
10.1109/TC.2015.2389828
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Flash memory has accelerated the architectural evolution of storage systems with its unique characteristics compared to magnetic disks. The no-overwrite property of flash memory naturally supports transactions, a commonly used mechanism in systems to provide consistency. However, existing embedded transaction designs in flash-based Solid State Drives (SSDs) either limit the transaction concurrency or introduce high overhead in tracking transaction states. This leads to low or unstable SSD performance. In this paper, we propose a transactional SSD (TxSSD) architecture, LightTx, to enable better concurrency and low overhead. First, LightTx improves transaction concurrency arbitrarily by using a page-independent commit protocol. Second, LightTx tracks the recent updates by leveraging the near-log-structured update property of SSDs and periodically retires dead transactions to reduce the transaction state tracking cost. Experiments show that LightTx achieves nearly the lowest overhead in garbage collection, memory consumption and mapping persistence compared to existing embedded transaction designs. LightTx also provides up to 20.6 percent performance improvement due to improved transaction concurrency.
引用
收藏
页码:2819 / 2832
页数:14
相关论文
共 50 条
  • [31] On the Endurance of the d-Choices Garbage Collection Algorithm for Flash-Based SSDs
    Verschoren, Robin
    Van Houdt, Benny
    ACM TRANSACTIONS ON MODELING AND PERFORMANCE EVALUATION OF COMPUTING SYSTEMS, 2019, 4 (03)
  • [32] An Efficient Block Address Transformation Scheme in Block Layer for Flash-Based SSDs
    Han, Jaehyun
    Son, Yongseok
    IEEE ACCESS, 2022, 10 : 14236 - 14245
  • [33] A Preliminary Study: Towards Parallel Garbage Collection for NAND Flash-Based SSDs
    Zhu, Guangyu
    Han, Jaehyun
    Son, Yongseok
    IEEE ACCESS, 2020, 8 : 223574 - 223587
  • [34] LCR: Load-aware Cache Replacement Algorithm for Flash-based SSDs
    Liu, Caiyin
    Lv, Min
    Pan, Yubiao
    Chen, Hao
    Li, Yongkun
    Li, Cheng
    Xu, Yinlong
    2018 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE AND STORAGE (NAS), 2018,
  • [35] Effective Lifetime-Aware Dynamic Throttling for NAND Flash-Based SSDs
    Lee, Sungjin
    Kim, Jihong
    IEEE TRANSACTIONS ON COMPUTERS, 2016, 65 (04) : 1075 - 1089
  • [36] Co-optimization of buffer layer and FTL in high-performance flash-based storage systems
    Hyotaek Shim
    Dawoon Jung
    Jaegeuk Kim
    Jin-Soo Kim
    Seungryoul Maeng
    Design Automation for Embedded Systems, 2010, 14 : 415 - 443
  • [37] Co-optimization of buffer layer and FTL in high-performance flash-based storage systems
    Shim, Hyotaek
    Jung, Dawoon
    Kim, Jaegeuk
    Kim, Jin-Soo
    Maeng, Seungryoul
    DESIGN AUTOMATION FOR EMBEDDED SYSTEMS, 2010, 14 (04) : 415 - 443
  • [38] Architecting Flash-based Solid-State Drive for High-performance I/O Virtualization
    Song, Xiang
    Yang, Jian
    Chen, Haibo
    IEEE COMPUTER ARCHITECTURE LETTERS, 2014, 13 (02) : 61 - 64
  • [39] ShadowGC Cooperative Garbage Collection with Multi-level Buffer for Performance Improvement in NAND flash-based SSDs
    Cui, Jinhua
    Zhang, Youlao
    Huang, Jianhang
    Wu, Weiguo
    Yang, Jun
    PROCEEDINGS OF THE 2018 DESIGN, AUTOMATION & TEST IN EUROPE CONFERENCE & EXHIBITION (DATE), 2018, : 1247 - 1252
  • [40] PACA: A Page Type Aware Read Cache Scheme in QLC Flash-based SSDs
    Chen, Qihui
    Wang, Shuai
    Zhou, You
    Wu, Fei
    Li, Shu
    Wang, Zhengyong
    Xie, Changsheng
    2022 IEEE 40TH INTERNATIONAL CONFERENCE ON COMPUTER DESIGN (ICCD 2022), 2022, : 59 - 66