np-ECC: Nonadjacent position error correction code for racetrack memory

Racetrack memory is a promising non-volatile memory because of its ultra-high storage density. The data are stored along the tape-like cell, where a “shift” operation is used to move the data in a cell back and forth to be accessed. Shift operations suffer from “position error”, where the shift distance is incorrect. Previous work solved the error by position error correction code (p-ECC). However, a bit error within the p-ECC bits will fail the correction mechanism. To protect p-ECC bits from bit errors, we propose a new mapping method for p-ECC, called nonadjacent position error correction code (np-ECC) in this paper. Evaluation shows significant reduction on correction mechanism failure rate.

[1]  Yu Wang,et al.  Hi-fi playback: Tolerating position errors in shift operations of racetrack memory , 2015, 2015 ACM/IEEE 42nd Annual International Symposium on Computer Architecture (ISCA).

[2]  Wenqing Wu,et al.  Array Organization and Data Management Exploration in Racetrack Memory , 2016, IEEE Transactions on Computers.

[3]  T. Trypiniotis,et al.  Magnetic domain-wall racetrack memory for high density and fast data storage , 2012, 2012 IEEE 11th International Conference on Solid-State and Integrated Circuit Technology.

[4]  Yan Zhou,et al.  Skyrmions as Compact, Robust and Energy-Efficient Interconnects for Domain Wall (DW)-based Systems , 2016, ArXiv.

[5]  Kaushik Roy,et al.  TapeCache: a high density, energy efficient cache based on domain wall memory , 2012, ISLPED '12.

[6]  S. Parkin,et al.  Magnetic Domain-Wall Racetrack Memory , 2008, Science.

[7]  Hai Li,et al.  Quantitative modeling of racetrack memory, a tradeoff among area, performance, and power , 2015, The 20th Asia and South Pacific Design Automation Conference.

[8]  Kaushik Roy,et al.  STAG: Spintronic-Tape Architecture for GPGPU cache hierarchies , 2014, 2014 ACM/IEEE 41st International Symposium on Computer Architecture (ISCA).