Content Popularity-Based Selective Replication for Read Redirection in SSDs

被引:7
|
作者
Elyasi, Nima [1 ]
Arjomand, Mohammad [2 ]
Sivasubramaniam, Anand [1 ]
Kandemir, Mahmut T. [1 ]
Das, Chita R. [1 ]
机构
[1] Penn State Univ, University Pk, PA 16802 USA
[2] Georgia Inst Technol, Atlanta, GA 30332 USA
关键词
SSD; Content Popularity; Replication; Read Redirection; EXPLOITING INTERNAL PARALLELISM; FLASH;
D O I
10.1109/MASCOTS.2018.00009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Despite high degrees of parallelism in terms of the number of chips and channels on state-of-the-art SSDs, resource contention continues to be a big impediment to boosting their performance for both read and write requests. This is particularly significant in the delays due to queueing for service from individual NAND-flash chips that can take dozens/hundreds of microseconds to perform the read/write operations. Owing to the no -write-in-place policy that is employed in flash chips, writes are inherently suited to be redirected to chips with lower load, in case their original destination chip is overloaded. However, to date, there has been no work to redirect read requests, since they cannot be serviced by other chips, which do not have the data. While blindly replicating all the data everywhere seems very promising from a read redirection perspective, doing so results in high space overheads, high write/replication overheads and lower endurance. This paper presents a novel approach to selective replication, wherein the popularity of data is used to figure out the "what", "how much", "where" and "when" questions for replication. Leveraging value locality/popularity, that is often observed in practice, popular data is replicated across multiple chips to provide more opportunities for dynamic read redirection to less loaded flash chips. Using extensive workload traces running over weeks from real systems, we show that our Read Redirected SSD (RR-SSD) can provide up to 45% improvement in read performance, with average improvement of 23.9%, and up to 40% improvement when considering both read and write requests, with 16% improvement on average.
引用
收藏
页码:1 / 15
页数:15
相关论文
共 50 条
  • [31] Popularity-Based Ranking for Fast Approximate kNN Search
    Antol, Matej
    Dohnal, Vlastislav
    INFORMATICA, 2017, 28 (01) : 1 - 21
  • [32] Content Size-Aware Edge Caching: A Size-Weighted Popularity-Based Approach
    Li, Qiang
    Shi, Wennian
    Xiao, Yong
    Ge, Xiaohu
    Pandharipande, Ashish
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,
  • [33] Popularity-based Partial Caching for Information Centric Networks
    Abani, Noor
    Farhadit, Golnaz
    Ito, Akira
    Gerla, Mario
    2016 15TH IFIP MEDITERRANEAN AD HOC NETWORKING WORKSHOP (MED-HOC-NET 2016), 2016,
  • [34] A popularity-based data allocation scheme for a VOD server
    Chang, CK
    Shih, CC
    Nguyen, TT
    Mongkolwat, P
    TWENTIETH ANNUAL INTERNATIONAL COMPUTER SOFTWARE & APPLICATIONS CONFERENCE (COMPSAC'96), PROCEEDINGS, 1996, 20 : 62 - 67
  • [35] Popularity-based scalable peer-to-peer topology growth
    Gunduz, Gurhan
    Yuksel, Murat
    COMPUTER NETWORKS, 2016, 100 : 124 - 140
  • [36] Clustered multimedia NOD: Popularity-based article prefetching and placement
    Kim, YJ
    Choi, TU
    Jung, KO
    Kang, YK
    Park, SH
    Chung, KD
    INFORMATION-BASED ACCESS TO STORAGE: THE FOUNDATION OF INFORMATION SYSTEMS, PROCEEDINGS, 1999, : 194 - 202
  • [37] Inter-Chunk Popularity-Based Edge-First Caching in Content-Centric Networking
    Lim, Sung-Hwa
    Ko, Young-Bae
    Jung, Gue-Hwan
    Kim, Jaehoon
    Jang, Myeong-Wuk
    IEEE COMMUNICATIONS LETTERS, 2014, 18 (08) : 1331 - 1334
  • [38] A Three-Way Recommender System for Popularity-Based Costs
    Xu, Yuan-Yuan
    Zhang, Heng-Ru
    Min, Fan
    ROUGH SETS, IJCRS 2017, PT II, 2017, 10314 : 278 - 289
  • [39] Popularity-Based Data Placement With Load Balancing in Edge Computing
    Wei, Xinliang
    Wang, Yu
    IEEE TRANSACTIONS ON CLOUD COMPUTING, 2023, 11 (01) : 397 - 411
  • [40] Base Station Popularity-Based Dynamic Resource Allocation for VNF
    Sun, Sanshan
    Zhou, Jianhong
    Sun, Yao
    Feng, Gang
    Qin, Shuang
    She, Wenkui
    PROCEEDINGS OF 2019 2ND INTERNATIONAL CONFERENCE ON COMMUNICATION ENGINEERING AND TECHNOLOGY (ICCET 2019), 2019, : 81 - 87