Abstract

A graph-theoretic formulation for memory repair in the presence of clustered faults is presented. This approach is based on the use of variable-cell-size grids (VCS grids). As VCS grids can be represented by bipartite graphs, the reconfiguration problem for clustered faults can also be formulated as a vertex covering problem. Hence, graph-based reconfiguration algorithms developed by previous authors can be extended to exploit clustered fault distributions. Algorithms for memory repair that do not suffer from the restrictions imposed by previous algorithms for clustered faults are developed. A heuristic repair algorithm that has both improved performance and lower execution time than previous repair algorithms is presented. >

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.