Best repair: an efficient reconfiguration for RRAM

Author

Banerjee, Shibaji ; Mukhopadhyay, Debdeep ; Chowdhury, Dipanwita Roy

Author_Institution

Dept. of Comput. Sci. & Eng., Indian Inst. of Technol., Kharagpur, India

fYear

2004

fDate

20-22 Dec. 2004

Firstpage

423

Lastpage

426

Abstract

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.

Keywords

computational complexity; fault diagnosis; graph theory; optimisation; performance evaluation; random-access storage; NP-complete problem; RRAM; heuristic algorithm; memory array reconfiguration; memory fault repairing; performance evaluation; probabilistic approach; random graph model; redundant random access memory; Algorithm design and analysis; Bipartite graph; Computer science; Greedy algorithms; Heuristic algorithms; Peak to average power ratio; Polynomials; Random access memory; Read-write memory;

fLanguage

English

Publisher

ieee

Conference_Titel

India Annual Conference, 2004. Proceedings of the IEEE INDICON 2004. First

Print_ISBN

0-7803-8909-3

Type

conf

DOI

10.1109/INDICO.2004.1497787

Filename

1497787