Age-based PCM wear leveling with nearly zero search cost

Age-based PCM wear leveling with nearly zero search cost
复制标题

DOI:
10.1145/2228360.2228439
复制
发表时间:
2012-06
期刊:
DAC Design Automation Conference 2012
影响因子:
--
通讯作者:
Chi-Hao Chen;P. Hsiu;Tei-Wei Kuo;Chia-Lin Yang;Cheng-Yuan Michael Wang
Chi-Hao Chen;P. Hsiu;Tei-Wei Kuo;Chia-Lin Yang;Cheng-Yuan Michael Wang
中科院分区:
其他
文献类型:
--
作者:
Chi-Hao Chen;P. Hsiu;Tei-Wei Kuo;Chia-Lin Yang;Cheng-Yuan Michael Wang

文献摘要

被引文献

相似文献

提高PCM的耐久性是一个基本问题,当该技术被认为是一种替代主存使用。在设计基于内存的磨损均衡方法时,一个主要的挑战是如何有效地确定用于分配或交换的适当内存页。在本文中,我们提出了一个有效的磨损均衡设计,是与现有的虚拟内存管理兼容。两种实现,即基于桶和基于阵列的磨损均衡,几乎为零的搜索成本,提出了权衡时间和空间的复杂性。基于流行的基准进行的实验结果,以评估所提出的设计的有效性是非常令人鼓舞的。
Improving the endurance of PCM is a fundamental issue when the technology is considered as an alternative to main memory usage. In the design of memory-based wear leveling approaches, a major challenge is how to efficiently determine the appropriate memory pages for allocation or swapping. In this paper, we present an efficient wear-leveling design that is compatible with existing virtual memory management. Two implementations, namely, bucket-based and array-based wear leveling, with nearly zero search cost are proposed to tradeoff time and space complexity. The results of experiments conducted based on popular benchmarks to evaluate the efficacy of the proposed design are very encouraging.