For Reconfiguration Of Memory Arrays C.p. In this paper, we present a new class of linear time heuristic algorithms for reconfiguring RRAMs. One novel feature of our algorithms is that we are able to derive new bounds on the fault counts for fast detection of reparable and irreparable RRAMs. Another novel feature is that, based on our algorithms, we are able to identify a new polynomial time solvable instance of the reconfiguration problem.
Empirical results indicate that our new class of algorithms is indeed fast and effective.
All Rights Reserved. The full text of is available to members of the IEEE Computer Society who have an online subscription and an e-account .