A New Algorithm for Floorplan Design
23rd ACM/IEEE Design Automation ConferencePublished 1 January 1986
Martin D. F. Wong, C.L. Liu
Citations369
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
Abstract
We present in this paper a new algorithm for floorplan design using the method of simulated annealing. The major contributions of the paper are: 1. A new representation of floorplans (normalized Polish expressions) which enables us to carry out the neighborhood search effectively. 2. A simultaneous minimization of area and total interconnection length in the final solution. Experimental results indicate that the algorithm performs well in many test problems.
Keywords
Computer ScienceEngineering
ScienceOptimization by Simulated Annealing
44,600 Citations1983Scott Kirkpatrick, C. D. Gelatt +1 more
A detailed analogy with annealing in solids provides a framework for optimization of the properties of very large and complex systems.
The Design and Analysis of Computer Algorithms
9,456 Citations1974Alfred V. Aho, John E. Hopcroft
This text introduces the basic data structures and programming techniques often used in efficient algorithms, and covers use of lists, push-down stacks, queues, trees, and graphs.
IEEE Journal of Solid-State CircuitsThe TimberWolf placement and routing package
534 Citations1985Carl Sechen, Alberto Sangiovanni‐Vincentelli
TimberWolf is an integrated set of placement and routing optimization programs for standard cell, macro/custom cell, and gate-array placement, as well as standard cell global routing.
Information and ControlOptimal orientations of cells in slicing floorplan designs
328 Citations1983Larry Stockmeyer
A methodology of VLSI layout described by several authors first determines the relative positions of indivisible pieces, called cells, on the chip and orientation optimization for more general layouts is shown to be NP-complete (in the strong sense).
A Min-Cut Placement Algorithm for General Cell Assemblies Based on a Graph Representation
131 Citations1979Ulrich Lauther
A new placement algorithm for general cell assemblies is presented which combines the ideas of polar graph representation and min-cut placement and global routing.
Proceedings of the nineteenth design automation conference on - DAC '82Automatic floorplan design
78 Citations1982Ralph H. J. M. Otten
The problem of allocating area to modules at the highest level of a top-down decomposition is treated and a theorem of Schoenberg is applied to obtain a good embedding of the module space into the plane.
19th Design Automation ConferenceThe Planar Package Planner for System Designers
30 Citations1982W. R. Heller, K. Maling +1 more