Optimal orientations of cells in slicing floorplan designs
Information and Control
DAC '82 Proceedings of the 19th Design Automation Conference
Placement algorithms for arbitrarily shaped blocks
DAC '79 Proceedings of the 16th Design Automation Conference
Parallel algorithms for slicing based final placement
EURO-DAC '92 Proceedings of the conference on European design automation
TINA: analog placement using enumerative techniques capable of optimizing both area and net length
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
ISPD '00 Proceedings of the 2000 international symposium on Physical design
Unifying behavioral synthesis and physical design
Proceedings of the 37th Annual Design Automation Conference
Goal oriented slicing enumeration through shape function clipping
EURO-DAC '91 Proceedings of the conference on European design automation
| Hi-index | 0.00 |
An algorithm for finding an optimal floor plan among all slicing structures consistent with a given plane point placement is presented. Here, consistent means that each slice corresponds with a rectangular subset of the point placement and that its child slices are ordered according to the coordinates on the associated axis. An optimal floor plan among these slicing structures is one that minimizes an object function, while satisfying the shape constraints of all blocks represented by the points. The object function must be a non-decreasing function of the height and the width of the floor plan. Area is just one such function. The algorithm is proven to be of polynomial time complexity in case all shape constraints are integer stair case functions.