A graph theoretic technique to speed up floorplan area optimization

Abstract

The authors present two algorithms to optimally select implementations for rectangular and L-shaped subfloorplans. The algorithms are designed specifically for the floorplan optimization algorithm given by T.-C. Wang and D.F. Wong (see Proc. 27th ACM/IEEE Des. Autom. Conf., p.180-6 (1990)), but they can also be applied to other algorithms as well. The experimental results, based on incorporating the two algorithms into Wang's algorithm, whose performance was considerably improved were very encouraging. For the test runs where Wang's algorithm failed to run, the algorithms helped to produce satisfactory solutions.<>