• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
Cai Changxing, Du Yajuan, Zhou Taiyu. Endurance Aware Out-of-Place Update for Persistent Memory[J]. Journal of Computer Research and Development, 2022, 59(3): 553-567. DOI: 10.7544/issn1000-1239.20210541
Citation: Cai Changxing, Du Yajuan, Zhou Taiyu. Endurance Aware Out-of-Place Update for Persistent Memory[J]. Journal of Computer Research and Development, 2022, 59(3): 553-567. DOI: 10.7544/issn1000-1239.20210541

Endurance Aware Out-of-Place Update for Persistent Memory

Funds: This work was supported by the National Natural Science Foundation of China (61802287) and the State Key Laboratory of Computer Architecture (ICT,CAS) (CARCH201903).
More Information
  • Published Date: February 28, 2022
  • Persistent memory has excellent characteristics such as non-volatility, byte-addressable, fast random read and write speed, low energy consumption, and large scalability, which provides new opportunities for big data storage and processing. However, the problem of crash consistency of persistent memory systems poses challenges to its widespread application. Existing research work on crash consistency guarantee usually takes extra read and write as the cost, which has a certain impact on the performance and lifetime of persistent memory systems in the time and space dimensions. To reduce this impact, an endurance aware out-of-place update for persistent memory(EAOOP) is proposed. Through software transparent out-of-place update technology, endurance aware memory management is provided for persistent memory, and data is alternately refreshed to the original data region and the updated data region. EAOOP not only guarantees the system’s crash consistency but also avoids redundant data merging operations. At the same time, to efficiently use the memory space, a lightweight garbage collection is performed in the background to process the old data in the updated data region, reducing extra write amplification and bandwidth occupation, thereby further reducing the impact on the lifetime and performance of the persistent memory. Evaluations show that EAOOP has higher performance and less overhead compared with existing work. Among them, the transaction throughput is increased by 1.6 times, and the critical path latency and the write number are decreased by 1.3 times.
  • Related Articles

    [1]Xia Tian, Fu Gelin, Qu Shaoru, Luo Zhongpei, Ren Pengju. Optimization of Parallel Computation on Sparse Matrix-Vector Multiplication with High Predictability[J]. Journal of Computer Research and Development, 2023, 60(9): 1973-1987. DOI: 10.7544/issn1000-1239.202330421
    [2]Xie Zhen, Tan Guangming, Sun Ninghui. Research on Optimal Performance of Sparse Matrix-Vector Multiplication and Convoulution Using the Probability-Process-Ram Model[J]. Journal of Computer Research and Development, 2021, 58(3): 445-457. DOI: 10.7544/issn1000-1239.2021.20180601
    [3]Feng Da, Zhou Fucai, Wang Qiang, Wu Qiyu. Efficient Verifiable Outsourcing of Solving Large-Scale Linear Equations with Low Storage Overhead[J]. Journal of Computer Research and Development, 2019, 56(5): 1123-1131. DOI: 10.7544/issn1000-1239.2019.20180191
    [4]Zheng Jianwei, Yang Ping, Wang Wanliang, Bai Cong. Kernel Sparse Representation Classification with Group Weighted Constraints[J]. Journal of Computer Research and Development, 2016, 53(11): 2567-2582. DOI: 10.7544/issn1000-1239.2016.20150743
    [5]Li Weibang, Li Zhanhuai, Chen Qun, Jiang Tao, Liu Hailong, Pan Wei. Functional Dependencies Discovering in Distributed Big Data[J]. Journal of Computer Research and Development, 2015, 52(2): 282-294. DOI: 10.7544/issn1000-1239.2015.20140229
    [6]Cui Zhen, Shan Shiguang, Chen Xilin. Structured Sparse Linear Discriminant Analysis[J]. Journal of Computer Research and Development, 2014, 51(10): 2295-2301. DOI: 10.7544/issn1000-1239.2014.20130188
    [7]Feng Lin, Liu Shenglan, Zhang Jing, and Wang Huibing. Robust Activation Function of Extreme Learning Machine and Linear Dimensionality Reduction in High-Dimensional Data[J]. Journal of Computer Research and Development, 2014, 51(6): 1331-1340.
    [8]Li Jiajia, Zhang Xiuxia, Tan Guangming, Chen Mingyu. Study of Choosing the Optimal Storage Format of Sparse Matrix Vector Multiplication[J]. Journal of Computer Research and Development, 2014, 51(4): 882-894.
    [9]Hu Changjun, Wei Shuo, Zhang Jilin, and Wang Jue. A Parallel SOR Algorithm for Linear Systems on SMP[J]. Journal of Computer Research and Development, 2007, 44(10): 1688-1693.
    [10]Ma Zhiqiang, Ji Zhenzhou, and Hu Mingzeng. A Low Power Data Cache Design Based on Very Narrow-Width Value[J]. Journal of Computer Research and Development, 2007, 44(5): 775-781.

Catalog

    Article views (271) PDF downloads (111) Cited by()

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return