DMCA
GORDIAN: VLSI placement by quadratic programming and slicing optimization (1991)
| Venue: | IEEE TRANS. COMPUTER-AIDED DESIGN |
| Citations: | 224 - 7 self |
BibTeX
@ARTICLE{Kleinhans91gordian:vlsi,
author = {Jürgen M. Kleinhans and Georg Sigl and Frank M. Johannes and Kurt J. Antreich},
title = {GORDIAN: VLSI placement by quadratic programming and slicing optimization},
journal = {IEEE TRANS. COMPUTER-AIDED DESIGN},
year = {1991},
volume = {10},
number = {3},
pages = {356--365}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
In this paper we present a new placement method for cell-based layout styles. It is composed of alternating and interacting global optimization and partitioning steps that are followed by an optimization of the area utilizaiton. Methods using the divide-and-conquer paradigm usually lose the global view by generating smaller and smaller subproblems. In contrast, GORDIAN maintains the simultaneous treatment of all cells over all global optimization steps, thereby considering constraints that reflect the current dissection of the circuit. The global optimizations are performed by solving quadratic programming problems that possess unique global minima. Improved partitioning schemes for the stepwise refinement of the placement are introduced. The area utilization is optimized by an exhaustive slicing procedure. The placement method has been applied to real world problems and excellent results in terms of both placement quality and computation time have been obtained.
Keyphrases
vlsi placement quadratic programming global optimization exhaustive slicing procedure placement method current dissection global view unique global minimum global optimization step area utilizaiton divide-and-conquer paradigm placement quality simultaneous treatment quadratic programming problem partitioning scheme stepwise refinement computation time excellent result new placement method real world problem layout style area utilization
