DocumentCode :
1538884
Title :
Loop-based design and reconfiguration of wafer-scale linear arrays with high harvest rates
Author :
Chang, Ming-Feng ; Fuchs, W. Kent
Author_Institution :
Coordinated Sci. Lab., Illinois Univ., IL, USA
Volume :
26
Issue :
5
fYear :
1991
fDate :
5/1/1991 12:00:00 AM
Firstpage :
717
Lastpage :
726
Abstract :
Design and reconfiguration approaches for high harvest rates and parallel on-wafer diagnosis of linear arrays are described. The defect-tolerant designs use multiplexers to switch intercell connections and guarantee that the wire length between any two logically adjacent cells is constant, independent of fault distribution. The designs are appropriate for implementing linear arrays of wafer-scale memory and processor architectures. The harvesting of fault-free cells into a linear array is a percolation process; there exists a critical cell yield such that the harvest rate drops to zero (approaches 100%) if the cell yield is below (above) the critical value. Finding a maximum-size linear array for a given set of fault-free cells is polynomial time solvable if only the interconnections between fault-free cells are utilized, but is NP-complete if the interconnections between all cells are utilized. A heuristic reconfiguration algorithm utilizing the interconnections between all cells is presented. Application of boundary scan to parallel testing and on-wafer diagnosis of the arrays is described
Keywords :
VLSI; cellular arrays; circuit reliability; computational complexity; fault tolerant computing; integrated circuit testing; integrated memory circuits; memory architecture; microprocessor chips; NP-complete; WSI; boundary scan; cell interconnections; critical cell yield; defect-tolerant designs; fault-free cells; heuristic reconfiguration algorithm; high harvest rates; loop based design; memory architectures; parallel on-wafer diagnosis; parallel testing; percolation process; polynomial time solvable; processor architectures; systolic arrays; wafer-scale linear arrays; Heuristic algorithms; Joining processes; Nearest neighbor searches; Polynomials; Propagation delay; Spirals; Switches; Systolic arrays; Testing; Wire;
fLanguage :
English
Journal_Title :
Solid-State Circuits, IEEE Journal of
Publisher :
ieee
ISSN :
0018-9200
Type :
jour
DOI :
10.1109/4.78242
Filename :
78242
Link To Document :
بازگشت