Optimal floorplan area optimization

An optimal algorithm for the floorplan area optimization problem is presented. The algorithm is based on an extension of the technique of L. Stockmeyer (1983). Experimental results indicate that the authors' algorithm is efficient and capable of successfully handling large floor plans. The algorithm is compared with the branch-and-bound optimal algorithm of S. Wimer et al. (ibid., vol.8, no.2, p.139-45, 1989). The running time of the present algorithm is substantially less than that of the Wimer algorithm. For several examples where the Wimer algorithm ran for days and did not terminate, the present algorithm produced optimal solutions in a few seconds. >

[1]  Larry J. Stockmeyer,et al.  Optimal Orientations of Cells in Slicing Floorplan Designs , 1984, Inf. Control..

[2]  Vipin Kumar,et al.  Floorplan optimization on multiprocessors , 1989, Proceedings 1989 IEEE International Conference on Computer Design: VLSI in Computers and Processors.

[3]  R. Otten.  Automatic Floorplan Design , 1982, DAC 1982.

[4]  Martin D. F. Wong,et al.  Efficient Floorplan Area Optimization , 1989, 26th ACM/IEEE Design Automation Conference.

[5]  Ulrich Lauther,et al.  A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation , 1979, 16th Design Automation Conference.

[6]  Martin D. F. Wong,et al.  An algorithm for hierarchical floorplan design , 1989, 1989 IEEE International Conference on Computer-Aided Design. Digest of Technical Papers.

[7]  Israel Koren,et al.  Optimal aspect ratios of building blocks in VLSI , 1988, DAC '88.

[8]  C. L. Liu,et al.  A New Algorithm for Floorplan Design , 1986, DAC 1986.