Time and Space-Efficient Write Parallelism in PCM by Exploiting Data Patterns

被引:5
|
作者
Li, Zheng [1 ]
Wang, Fang [1 ]
Feng, Dan [1 ]
Hua, Yu [1 ]
Liu, Jingning [1 ]
Tong, Wei [1 ]
Chen, Yu [1 ]
Harb, Salah S. [1 ]
机构
[1] Huazhong Univ Sci & Technol, Wuhan Natl Lab Optoelect, Key Lab Informat Storage Syst, Sch Comp Sci & Technol,Minist Educ China, Sheng 430074, Hubei, Peoples R China
关键词
PCM; write unit; performance evaluation; write energy; PHASE-CHANGE MEMORY;
D O I
10.1109/TC.2017.2677903
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The size of write unit in PCM, namely the number of bits allowed to be written concurrently at one time, is restricted due to high write energy consumption. It typically needs several serially executed write units to finish a cache line service when using PCM as the main memory, which results in long write latency and high energy consumption. To address the poor write performance problem, we propose a novel PCM write scheme called Min-WU (Minimize the number of Write Units). We observe data access locality that some frequent zero-extended values dominate the write data patterns in typical multi-threaded applications (more than 40 and 44.9 percent of all memory accesses in PARSEC workloads and SPEC 2006 benchmarks, respectively). By leveraging carefully designed chip-level data redistribution method, the data amount is balanced and the data pattern is the same among all PCM chips. The key idea behind Min-WU is to minimize the number of serially executed write units in a cache line service after data redistribution through sFPC (simplified Frequent Pattern Compression), eRW (efficient Reordering Write operations method) and fWP (fine-tuned Write Parallelism circuits). Using Min-WU, the zero parts of write units can be indicated with predefined prefixes and the residues can be reordered and written simultaneously under power constraints. Our design can improve the performance, energy consumption and endurance of PCM-based main memory with low space and time overhead. Experimental results of 12 multi-threaded PARSEC 2.0 workloads show that Min-WU reduces 44 percent read latency, 28 percent write latency, 32.5 percent running time and 48 percent energy while receiving 32 percent IPC improvement compared with the conventional write scheme with few memory cycles and less than 3 percent storage space overhead. Evaluation results of 8 SPEC 2006 benchmarks demonstrate that Min-WU earns 57.8/46.0 percent read/write latency reduction, 28.7 percent IPC improvement, 28 percent running time reduction and 62.1 percent energy reduction compared with the baseline under realistic memory hierarchy configurations.
引用
收藏
页码:1629 / 1644
页数:16
相关论文
共 50 条
  • [41] Space-efficient Graph Data Placement to Save Energy of ReRAM Crossbar
    Lo, Ting-Shan
    Wu, Chun-Feng
    Chang, Yuan-Hao
    Kuo, Tei-Wei
    Wang, Wei-Chen
    [J]. 2021 IEEE/ACM INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN (ISLPED), 2021,
  • [42] EXPLOITING PATTERNS OF DATA MAGNITUDE FOR EFFICIENT IMAGE CODING
    Said, Amir
    Mukherjee, Debargha
    [J]. 2008 15TH IEEE INTERNATIONAL CONFERENCE ON IMAGE PROCESSING, VOLS 1-5, 2008, : 2900 - 2903
  • [43] Improving the Run-Time of Space-Efficient n-Gram Data Structures Using Apache Spark
    Kounelis, Fotios
    Kanavos, Andreas
    Mylonas, Phivos
    [J]. GENEDIS 2020: COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2021, 1338 : 165 - 173
  • [44] Space-Efficient, Fast and Exact Routing in Time-Dependent Road Networks
    Strasser, Ben
    Wagner, Dorothea
    Zeitz, Tim
    [J]. ALGORITHMS, 2021, 14 (03)
  • [45] PairwiseHist: Fast, Accurate and Space-Efficient Approximate Query Processing with Data Compression
    Hurst, Aaron
    Lucani, Daniel E.
    Zhang, Qi
    [J]. PROCEEDINGS OF THE VLDB ENDOWMENT, 2024, 17 (06): : 1432 - 1445
  • [46] COMPACTION OF MESSAGE PATTERNS INTO SPACE-EFFICIENT REPRESENTATIONS FOR MULTIPROCESSOR INTERCONNECTION NETWORKS (EXTENDED ABSTRACT)
    BERNHARD, PJ
    HUNT, HB
    ROSENKRANTZ, DJ
    [J]. PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 1: ARCHITECTURE, 1989, : I111 - I115
  • [47] Qualizon Graphs: Space-Efficient Time-Series Visualization with Qualitative Abstractions
    Federico, Paolo
    Hoffmann, Stephan
    Rind, Alexander
    Aigner, Wolfgang
    Miksch, Silvia
    [J]. PROCEEDINGS OF THE 2014 INTERNATIONAL WORKING CONFERENCE ON ADVANCED VISUAL INTERFACES, AVI 2014, 2014, : 273 - 280
  • [48] Space-efficient estimation of empirical tail dependence coefficients for bivariate data streams
    Gregory, Alastair
    Jana, Kaushik
    [J]. STATISTICAL ANALYSIS AND DATA MINING, 2020, 13 (01) : 14 - 30
  • [49] Interactive and space-efficient multi-dimensional time series subsequence matching
    Piatov, Danila
    Helmer, Sven
    Dignos, Anton
    Gamper, Johann
    [J]. INFORMATION SYSTEMS, 2019, 82 : 121 - 135
  • [50] Time- and space-efficient evaluation of sparse Boolean functions in embedded software
    Dvorak, Vaclav
    [J]. ECBS 2007: 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, Proceedings: RAISING EXPECTATIONS OF COMPUTER-BASES SYSTEMS, 2007, : 178 - 185