Remap-Based Inter-Partition Copy for Arrayed Solid-State Drives

被引:5
作者
Han, Kyuhwa [1 ]
Shin, Dongkun [2 ]
机构
[1] Samsung Elect Co Ltd, Hwaseong 18448, South Korea
[2] Sungkyunkwan Univ, Dept Elect & Comp Engn, Suwon 16419, South Korea
关键词
Integrated circuits; Arrays; Parallel processing; Resource management; Hardware; Distributed databases; Bandwidth; Flash memory; flash translation layer; remap; solid-state drives; block allocation;
D O I
10.1109/TC.2021.3099694
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The internal copy (IC) is a simple, yet powerful in-storage processing function, which changes the locations of data blocks without invoking any data transfer between the host and storage. Owing to the out-of-place update constraint of flash memory, solid-state disks (SSDs) employ a flash translation layer (FTL) to manage the logical-to-physical address translation. By leveraging the address indirection feature of SSDs, the IC can be processed only by remapping flash pages to new logical addresses without flash read/write operations. In the existing studies on remap-based IC, SSDs were assumed to have only a single FTL instance. However, recent large-capacity SSDs adopt an arrayed architecture including multiple FTL controllers, where each controller runs an FTL instance to manage its own partitioned address space. For the arrayed SSDs, inter-partition copy requests cannot be handled by address remapping because each partition is managed by a different FTL instance. In this study, we propose an inter-partition remap technique for IC-enabled arrayed SSDs. Additionally, we present the block allocation technique to minimize the number of inter-partition copy requests. Our proposed IC techniques were implemented on an actual arrayed SSD, and showed significant performance improvements compared to the previous remap techniques in several use cases.
引用
收藏
页码:1640 / 1654
页数:15
相关论文
共 50 条
  • [1] IBU: An In-Block Update Address Mapping Scheme for Solid-State Drives
    Taghizadeh, Reza Gholami
    Marvasti, Mohammadreza Binesh
    Asghari, Seyyed Amir
    Taghizadeh, Ramin Gholami
    Nabavi, Morteza
    Savaria, Yvon
    IEEE ACCESS, 2022, 10 : 4934 - 4947
  • [2] Coordinating Garbage Collection for Arrays of Solid-State Drives
    Kim, Youngjae
    Lee, Junghee
    Oral, Sarp
    Dillow, David A.
    Wang, Feiyi
    Shipman, Galen M.
    IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (04) : 888 - 901
  • [3] Parallelism-Aware Channel Partition for Read/Write Interference Mitigation in Solid-State Drives
    Lim, Hyun Jo
    Shin, Dongkun
    Han, Tae Hee
    ELECTRONICS, 2022, 11 (23)
  • [4] Error Characterization, Mitigation, and Recovery in Flash-Memory-Based Solid-State Drives
    Cai, Yu
    Ghose, Saugata
    Haratsch, Erich F.
    Luo, Yixin
    Mutlu, Onur
    PROCEEDINGS OF THE IEEE, 2017, 105 (09) : 1666 - 1704
  • [5] Internal Parallelism of Flash Memory-Based Solid-State Drives
    Chen, Feng
    Hou, Binbing
    Lee, Rubao
    ACM TRANSACTIONS ON STORAGE, 2016, 12 (03)
  • [6] Efficient Cache Design for Solid-State Drives
    Huang, Miaoqing
    Serres, Olivier
    Narayana, Vikram K.
    El-Ghazawi, Tarek
    Newby, Gregory
    PROCEEDINGS OF THE 2010 COMPUTING FRONTIERS CONFERENCE (CF 2010), 2010, : 41 - 50
  • [7] Architecture and Technologies of Flash Memory Based Solid State Drives
    Gao C.
    Shi L.
    Liu K.
    Xue C.
    Shu J.
    Jisuanji Yanjiu yu Fazhan/Computer Research and Development, 2021, 58 (07): : 1518 - 1532
  • [8] An empirical study of redundant array of independent solid-state drives (RAIS)
    Kim, Youngjae
    CLUSTER COMPUTING-THE JOURNAL OF NETWORKS SOFTWARE TOOLS AND APPLICATIONS, 2015, 18 (02): : 963 - 977
  • [9] Request Flow Coordination for Growing-Scale Solid-State Drives
    Yang, Ming-Chang
    Chang, Yuan-Hao
    Kuo, Tei-Wei
    Wu, Chun-Feng
    IEEE TRANSACTIONS ON COMPUTERS, 2020, 69 (06) : 832 - 843
  • [10] Towards Scalable Analytics with Inference-Enabled Solid-State Drives
    Kim, Minsub
    Kung, Jaeha
    Lee, Sungjin
    IEEE COMPUTER ARCHITECTURE LETTERS, 2020, 19 (01) : 13 - 17