Spare allocation and reconfiguration in large area VLSI

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.<<ETX>>