Existing floorplanuers that use shcing floorplans are efficient in runtime and yet can pack modties tightly. Ho~vever,none of them can handle pre-placed modules. In this paper,}ve est end a ~ve~-kno~vnslicing floorplanner [10] to handle preplaced modules. Our main contribution is a novel shape curve computation procedure \vhich can take the positions of the pre-placed moddes into consideration. The shape curve computation procedure is used repeatedly during the floorplanning process to f~y exTloit the shape flexibility of the modules to give a tight packing. Expenmentd results sho~vthat the extended floorplanner performs very ~ve~.
The building blocks in a given floor-plan may have several possible physical implementations yie1din...
[[abstract]]A well known approach for the floorplan area optimization problem is to first determine ...
Recent advances in VLSI technology have made optimization of the interconnect delay and routability ...
[[abstract]]In this paper, we present an efficient algorithm to construct shape curves for floorplan...
Slicing tree has been an effective tool for VLSI floorplan de-sign. Floorplanners using slicing tree...
In floorplan design, it is common that a designer will want to control the positions of some modules...
In this paper, a fixed-outline floorplan-ning algorithm based on 2.5D is proposed. By using constrai...
[[abstract]]We consider in this paper the problem of slicing floorplan design with boundary-constrai...
Unlike classical floorplanning that usually handles only block packing to minimize silicon area, mod...
Abstract—This paper presents an efficient, scalable, and op-timal slack-driven shaping algorithm for...
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree represe...
[[abstract]]Recently Young and Wong extended the well-known simulated annealing based Wong-Liu algor...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.In this thesis, a systematic ...
The first stage in hierarchical approaches to floorplan design determines certain topological relati...
[[abstract]]A well known approach for the floorplan are optimization problem is to first determine a...
The building blocks in a given floor-plan may have several possible physical implementations yie1din...
[[abstract]]A well known approach for the floorplan area optimization problem is to first determine ...
Recent advances in VLSI technology have made optimization of the interconnect delay and routability ...
[[abstract]]In this paper, we present an efficient algorithm to construct shape curves for floorplan...
Slicing tree has been an effective tool for VLSI floorplan de-sign. Floorplanners using slicing tree...
In floorplan design, it is common that a designer will want to control the positions of some modules...
In this paper, a fixed-outline floorplan-ning algorithm based on 2.5D is proposed. By using constrai...
[[abstract]]We consider in this paper the problem of slicing floorplan design with boundary-constrai...
Unlike classical floorplanning that usually handles only block packing to minimize silicon area, mod...
Abstract—This paper presents an efficient, scalable, and op-timal slack-driven shaping algorithm for...
We present in this paper a multilevel floorplanning/placement framework based on the B*-tree represe...
[[abstract]]Recently Young and Wong extended the well-known simulated annealing based Wong-Liu algor...
129 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1987.In this thesis, a systematic ...
The first stage in hierarchical approaches to floorplan design determines certain topological relati...
[[abstract]]A well known approach for the floorplan are optimization problem is to first determine a...
The building blocks in a given floor-plan may have several possible physical implementations yie1din...
[[abstract]]A well known approach for the floorplan area optimization problem is to first determine ...
Recent advances in VLSI technology have made optimization of the interconnect delay and routability ...