Performance evaluation of a reconfiguration-algorithm for memory arrays containing clustered faults

The memory-reconfiguration problem, encountered while repairing clustered faults of arrays with a programmable assignment of spare rows and columns to faulty ones, has been evaluated under a probabilistic quadrat-based fault model. The quadrat reconfiguration clustered fault algorithm (QRCF) repairs large fault clusters without holes exactly in polynomial time. It also scores over the approximation and optimal algorithms in execution-time and performance. The comparative performances of the various algorithms based on detailed simulation results are presented.