Age-based PCM wear leveling with nearly zero search cost

  • Authors:
  • Chi-Hao Chen;Pi-Cheng Hsiu;Tei-Wei Kuo;Chia-Lin Yang;Cheng-Yuan Michael Wang

  • Affiliations:
  • National Taiwan University, Taipei, Taiwan;Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan, and Institute of Information Science, Academia Sinica, Taipei, Taiwan;National Taiwan University, Taipei, Taiwan, Research Center for Information Technology Innovation, Academia Sinica, Taipei, Taiwan, and Institute of Information Science, Academia Sinica, Taipei, T ...;National Taiwan University, Taipei, Taiwan;Macronix Int'l Co., Ltd., Hsinchu, Taiwan

  • Venue:
  • Proceedings of the 49th Annual Design Automation Conference
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

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.