DocumentCode
846723
Title
Probabilistic analysis and algorithms for reconfiguration of memory arrays
Author
Shi, Weiping ; Fuchs, W. Kent
Author_Institution
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Volume
11
Issue
9
fYear
1992
fDate
9/1/1992 12:00:00 AM
Firstpage
1153
Lastpage
1160
Abstract
Reconfiguration of memory arrays with spare rows and columns has been shown to be an NP-complete problem. An analysis of average-case time complexities of several existing heuristics is presented, as well as a provably average-case polynomial-time algorithm for reconfiguration of memories with spare rows and columns. The algorithm runs faster than previous heuristics when the problem size is larger
Keywords
cellular arrays; integrated memory circuits; logic design; probability; NP-complete problem; average-case polynomial-time algorithm; average-case time complexities; heuristics; memory arrays; probabilistic analysis; reconfiguration; spare columns; spare rows; Algorithm design and analysis; Application specific integrated circuits; Bipartite graph; Circuit faults; Conferences; Fault tolerant systems; Integrated circuit manufacture; Integrated circuit yield; NP-complete problem; Polynomials;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.160001
Filename
160001
Link To Document