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 条
  • [21] An Operator Approach to Popularity-based Caching in DHTs
    Despotovic, Zoran
    Hofstaetter, Quirin
    Michel, Maximilian
    Kellerer, Wolfgang
    2010 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, 2010,
  • [22] WAVE: Popularity-based and Collaborative In-network Caching for Content-Oriented Networks
    Cho, Kideok
    Lee, Munyoung
    Park, Kunwoo
    Kwon, Ted Taekyoung
    Choi, Yanghee
    Pack, Sangheon
    2012 IEEE CONFERENCE ON COMPUTER COMMUNICATIONS WORKSHOPS (INFOCOM WKSHPS), 2012, : 316 - 321
  • [23] A popularity-based prediction model for Web perfetching
    Chen, X
    Zhang, XD
    COMPUTER, 2003, 36 (03) : 63 - +
  • [24] LEARNING SPARSE DICTIONARIES WITH A POPULARITY-BASED MODEL
    Feng, Jianzhou
    Song, Li
    Huo, Xiaoming
    Yang, Xiaokang
    Zhang, Wenjun
    2011 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2011, : 1441 - 1444
  • [25] Popularity-based Detection of Domain Generation Algorithms
    Abbink, Jasper
    Doerr, Christian
    PROCEEDINGS OF THE 12TH INTERNATIONAL CONFERENCE ON AVAILABILITY, RELIABILITY AND SECURITY (ARES 2017), 2017,
  • [26] Popularity-Based Cache Placement for Fog Networks
    Althamary, Ibrahim
    Huang, Chih-Wei
    Lin, Phone
    Yang, Shun-Ren
    Cheng, Chien-Wei
    2018 14TH INTERNATIONAL WIRELESS COMMUNICATIONS & MOBILE COMPUTING CONFERENCE (IWCMC), 2018, : 800 - 804
  • [27] A popularity-based prediction model for web prefetching
    Chen, X. (xinchen@cs.wm.edu), 1600, Institute of Electrical and Electronics Engineers Computer Society (36):
  • [28] Group Fairness for Content Creators: the Role of Human and Algorithmic Biases under Popularity-based Recommendations
    Ionescu, Stefania
    Hannak, Aniko
    Pagan, Nicolo
    PROCEEDINGS OF THE 17TH ACM CONFERENCE ON RECOMMENDER SYSTEMS, RECSYS 2023, 2023, : 863 - 870
  • [29] The Limits of Popularity-Based Recommendations, and the Role of Social Ties
    Bressan, Marco
    Leucci, Stefano
    Panconesi, Alessandro
    Raghavan, Prabhakar
    Terolli, Erisa
    KDD'16: PROCEEDINGS OF THE 22ND ACM SIGKDD INTERNATIONAL CONFERENCE ON KNOWLEDGE DISCOVERY AND DATA MINING, 2016, : 745 - 754
  • [30] Popularity-based Congestion Control in Named Data Networking
    Park, Heungsoon
    Jang, Hoseok
    Kwon, Taewook
    2014 SIXTH INTERNATIONAL CONFERENCE ON UBIQUITOUS AND FUTURE NETWORKS (ICUFN 2014), 2014, : 166 - 171