Data Block Partitioning Methods to Mitigate Stuck-At Faults in Limited Endurance Memories

被引:1
|
作者
Zhang, Jiangwei [1 ,2 ]
Kline, Donald, Jr. [2 ]
Fang, Liang [1 ]
Melhem, Rami [3 ]
Jones, Alex K. [2 ]
机构
[1] Natl Univ Def Technol, Changsha 410073, Hunan, Peoples R China
[2] Univ Pittsburgh, ECE Dept, Pittsburgh, PA 15261 USA
[3] Univ Pittsburgh, CS Dept, Pittsburgh, PA 15260 USA
基金
中国国家自然科学基金; 美国国家科学基金会;
关键词
Dynamic partitioning; emerging memories; reliability; stuck-at faults;
D O I
10.1109/TVLSI.2018.2858186
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Deep scaling in conjunction with increased process variation has resulted in increasingly faulty memories. Emerging memories, particularly phase-change and resistive memories, can experience stuck-at faults due to limited endurance. Partition and flip (PAF) schemes partition data into blocks and invert these blocks as needed to ensure data that is written matches the stuck-at cells. In this paper, we propose two novel correction schemes that substantially enhance the fault-tolerance capabilities of existing PAF techniques. First, dynamic partitioning increases the number of possible configurations with equivalent auxiliary bits. At high fixed error rates, the increase in configurations results in improved write error rates for flip-N-write and Aegis partitioning by 7%-72% and 5-53x, respectively. Our second novel partitioning method, relaxed partitioning, dramatically and effectively increases the partitioning search space by specifying minimally overlapping configurations. Through Monte Carlo simulations, data-aware dynamic partitioning tolerates 25% and 27% more faults over its lifetime than Aegis with 36 and 43 auxiliary bits per 512-bit data block, respectively, while relaxed partitioning achieves an extra 15% and 24% additional improvement while requiring two fewer overhead bits per data block.
引用
收藏
页码:2358 / 2371
页数:14
相关论文
共 7 条
  • [1] Dynamic Partitioning to Mitigate Stuck-at Faults in Emerging Memories
    Zhang, Jiangwei
    Kline, Donald, Jr.
    Fang, Liang
    Melhem, Rami
    Jones, Alex K.
    [J]. 2017 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2017, : 651 - 658
  • [2] Data Block Partitioning for Recovering Stuck-at Faults in PCMs
    Asadinia, Marjan
    Jalili, Majid
    Sarbazi-Azad, Hamid
    [J]. 2017 INTERNATIONAL CONFERENCE ON NETWORKING, ARCHITECTURE, AND STORAGE (NAS), 2017, : 157 - 164
  • [3] Location of stuck-at faults and bridging faults based on circuit partitioning
    Pomeranz, I
    Reddy, SM
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (10) : 1124 - 1135
  • [4] PROPERTIES OF TRANSPARENT SHORTENED CODES FOR MEMORIES WITH STUCK-AT FAULTS
    SUNDBERG, CE
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1979, 28 (09) : 686 - 690
  • [5] OPTIMAL ALGORITHM FOR TESTING STUCK-AT FAULTS IN RANDOM-ACCESS MEMORIES
    KNAIZUK, J
    HARTMANN, CRP
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1977, 26 (11) : 1141 - 1144
  • [7] Block-iterative interior point optimization methods for image reconstruction from limited data
    Byrne, C
    [J]. INVERSE PROBLEMS, 2000, 16 (05) : 1405 - 1419