Title :
Spare allocation and reconfiguration in large area VLSI
Author :
Kuo, Sy-Yen ; Fuchs, W. Kent
Author_Institution :
Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Abstract :
A summary of systematic approach developed by the authors for spare allocation and reconfiguration is presented. Spare allocation is modeled in graph-theoretic terms in which spare allocation for a specific reconfigurable system is shown to be equivalent to either a graph-matching or a graph-dominating-set problem. The complexity of optimal spare allocation for each of the problem classes is analyzed, and reconfiguration algorithms are provided.<>
Keywords :
VLSI; graph theory; network topology; redundancy; complexity; graph-dominating-set problem; graph-matching; large area VLSI; reconfiguration; spare allocation; yield enhancement; Algorithm design and analysis; Contracts; Cost function; Degradation; Logic design; Manufacturing; Reconfigurable logic; System performance; Very large scale integration; Wafer scale integration;
Conference_Titel :
Design Automation Conference, 1988. Proceedings., 25th ACM/IEEE
Conference_Location :
Anaheim, CA, USA
Print_ISBN :
0-8186-0864-1
DOI :
10.1109/DAC.1988.14826
