83 search results - page 1 / 17 » Improved Cut Sequences for Partitioning Based Placement |
73
Voted
DAC
2001
ACM
15 years 10 months ago
2001
ACM
Recursive partitioning based placement has a long history, but there has been little consensus on how cut sequences should be chosen. In this paper, we present a dynamic programmi...
ICCAD
1994
IEEE
15 years 1 months ago
1994
IEEE
We present a new min-cut based placement algorithm for large scale sea-of-gates arrays. In the past all such algorithms used a xed cut line sequence that is determined before min...
ICCAD
2003
IEEE
15 years 6 months ago
2003
IEEE
In this paper, we present improvements to recursive bisection based placement. In contrast to prior work, our horizontal cut lines are not restricted to row boundaries; this avoid...
102
click to vote
ISPD
2007
ACM
14 years 11 months ago
2007
ACM
In this paper, we derive the X-half-perimeter wirelength (XHPWL) model for X-architecture placement and explore the effects of three different wire models on X-architecture plac...
DAC
1994
ACM
15 years 1 months ago
1994
ACM
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...