The Community for Technology Leaders
Design Automation Conference (1988)
Anaheim, CA, USA
June 12, 1988 to June 15, 1988
ISBN: 0-8186-0864-1
pp: 609-612
Kuo , Coordinated Sci. Lab., Illinois Univ., Urbana, IL, USA
Fuchs , 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.
INDEX TERMS
yield enhancement, reconfiguration, large area VLSI, spare allocation, graph-matching, graph-dominating-set problem, complexity
CITATION

Kuo and Fuchs, "Spare allocation and reconfiguration in large area VLSI," Design Automation Conference(DAC), Anaheim, CA, USA, 1988, pp. 609-612.
doi:10.1109/DAC.1988.14826
96 ms
(Ver 3.3 (11022016))