A Framework for Solving VSLI Graph Layout Problems

Abstract

This paper introduces a new divide-and-conquer framework for VLSI graph layout. Universally close upper and lower bounds are obtained for important cost functions such as layout area and propagation delay. The framework is also effectively used to design regular and configuration layouts, to assemble large networks of processors using restructurable chips, and to configure networks around faulty processors. it is also shown how good graph partitioning heuristics may be used to develop a provably good layout strategy.