Sciweavers

6 search results - page 1 / 2
» Optimization of Linear Placements for Wirelength Minimizatio...
Sort
View
ASPDAC
1999
ACM
93views Hardware» more  ASPDAC 1999»
13 years 9 months ago
Optimization of Linear Placements for Wirelength Minimization with Free Sites
We study a type of linear placement problem arising in detailed placement optimization of a given cell row in the presence of white-space (extra sites). In this single-row placeme...
Andrew B. Kahng, Paul Tucker, Alexander Zelikovsky
ISPD
1997
ACM
68views Hardware» more  ISPD 1997»
13 years 8 months ago
Faster minimization of linear wirelength for global placement
A linear wirelength objective more e ectively captures timing, congestion, and other global placement considerations than a squared wirelength objective. The GORDIAN-L cell placem...
Charles J. Alpert, Tony F. Chan, Dennis J.-H. Huan...
ASPDAC
2000
ACM
159views Hardware» more  ASPDAC 2000»
13 years 9 months ago
Analytical minimization of half-perimeter wirelength
Global placement of hypergraphs is critical in the top-down placement of large timing-driven designs 10, 16 . Placement quality is evaluated in terms of the half-perimeter wirelen...
Andrew A. Kennings, Igor L. Markov
ICCAD
1999
IEEE
113views Hardware» more  ICCAD 1999»
13 years 9 months ago
Attractor-repeller approach for global placement
Traditionally, analytic placement used linear or quadratic wirelength objective functions. Minimizing either formulation attracts cells sharing common signals (nets) together. The...
Hussein Etawil, Shawki Areibi, Anthony Vannelli
ISPD
2004
ACM
189views Hardware» more  ISPD 2004»
13 years 10 months ago
Almost optimum placement legalization by minimum cost flow and dynamic programming
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
Ulrich Brenner, Anna Pauli, Jens Vygen