Best repair: an efficient reconfiguration for RRAM

Reconfiguration of memory arrays with spare rows and columns has been shown to be NP-complete problem. The present paper develops a novel heuristic algorithm which solves the reconfiguration problem. The conventional technique to find the vertex cover using maximum degree has been modified using an additional step to search first for the vertices of degree one. The new heuristic algorithm found to offer a better solution in repairing the memory faults in cases where some of the existing algorithms have failed. The performance has been evaluated using extensive experimentation and probabilistic approach based on a random graph model.