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 条
  • [41] A popularity-based approach for effective Cloud offload in Fog deployments
    Enguehard, Marcel
    Carofiglio, Giovanna
    Rossi, Dario
    PROCEEDINGS OF THE 2018 30TH INTERNATIONAL TELETRAFFIC CONGRESS (ITC 30), VOL 1, 2018, : 55 - 63
  • [42] Popularity-Based Online Scaling for RAID Systems Under General Settings
    Tian, Chengjin
    Li, Yongkun
    Wu, Si
    Chen, Jinzhong
    Yuan, Liu
    Xu, Yinlong
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2020, 39 (10) : 2911 - 2924
  • [43] Dynamic Popularity-Based Caching Permission Strategy for Named Data Networking
    Yu, Meiju
    Li, Ru
    PROCEEDINGS OF THE 2018 IEEE 22ND INTERNATIONAL CONFERENCE ON COMPUTER SUPPORTED COOPERATIVE WORK IN DESIGN ((CSCWD)), 2018, : 576 - 581
  • [44] Popularity-based Neighborhood Collaborative Caching for Information-Centric Networks
    Zhu, Xiaodong
    Wang, Jinlin
    Wang, Lingfang
    Qi, Weining
    2017 IEEE 36TH INTERNATIONAL PERFORMANCE COMPUTING AND COMMUNICATIONS CONFERENCE (IPCCC), 2017,
  • [45] PTEM: A POPULARITY-BASED TOPICAL EXPERTISE MODEL FOR COMMUNITY QUESTION ANSWERING
    Jung, Hohyun
    Lee, Jae-Gil
    Lee, Namgil
    Kim, Sung-Ho
    ANNALS OF APPLIED STATISTICS, 2020, 14 (03): : 1304 - 1325
  • [46] Signaling protocol for session-aware popularity-based resource allocation
    Mendes, P
    Schulzrinne, H
    Monteiro, E
    MANAGEMENT OF MULTIMEDIA ON THE INTERNET, 2002, 2496 : 101 - 113
  • [47] The few-get-richer: a surprising consequence of popularity-based rankings
    Germano, Fabrizio
    Gomez, Vicenc
    Le Mens, Gael
    WEB CONFERENCE 2019: PROCEEDINGS OF THE WORLD WIDE WEB CONFERENCE (WWW 2019), 2019, : 2764 - 2770
  • [48] Accelerating Last-Mile Web Performance with Popularity-Based Prefetching
    Sundaresan, Srikanth
    Magharei, Nazanin
    Feamster, Nick
    Teixeira, Renata
    ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, 2012, 42 (04) : 303 - 304
  • [49] Popularity-Based Approach to Promote Cooperation in The Prisoner's Dilemma Game
    Dean, Nur
    Nakashyan, George K.
    PROCEEDINGS OF THE 2023 IEEE/ACM INTERNATIONAL CONFERENCE ON ADVANCES IN SOCIAL NETWORKS ANALYSIS AND MINING, ASONAM 2023, 2023, : 1 - 8
  • [50] Similarity-Aware Popularity-based Caching in Wireless Edge Computing
    Wei, Xianglin
    Liu, Jianwei
    Wang, Junwei
    Wang, Yangang
    Fan, Jianhua
    17TH ACM INTERNATIONAL CONFERENCE ON COMPUTING FRONTIERS 2020 (CF 2020), 2020, : 257 - 260