ISPD
2007
ACM
13 years 6 months ago
2007
ACM
Traditionally, research in global placement has focused on relatively few simple metrics, such as pure wirelength or routability estimates. However, in the real world today, desig...
ASPDAC
2006
ACM
13 years 8 months ago
2006
ACM
Abstract-- In this paper, we present FastPlace 2.0
ICCAD
1997
IEEE
13 years 8 months ago
1997
IEEE
We present a new approach to the placement problem. The proposed approach consists of analyzing the input circuit and deciding on a two-dimensional global grid for that particular...
DAC
2003
ACM
13 years 9 months ago
2003
ACM
This paper describes a new force directed global placement algorithm that exploits and extends techniques from two leading placers, Force-directed [12] [26] and Mongrel [22]. It c...
DATE
2003
IEEE
13 years 9 months ago
2003
IEEE
– Floorplanning large designs with many hard macros and IP blocks of various sizes is becoming an increasingly important and challenging problem. This paper presents a global flo...
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
Delay minimization continues to be an important objective in the design of high-performance computing system. In this paper, we present an effective methodology to guide the delay...
ISPD
2005
ACM
13 years 10 months ago
2005
ACM
In this paper, we present a hierarchical ratio partitioning based placement algorithm for large-scale mixed-size designs. The placement algorithm consists of three steps: global p...
ASPDAC
2006
ACM
13 years 10 months ago
2006
ACM
— The rapid increase in IC design complexity and wide-spread use of intellectual-property (IP) blocks have made the so-called mixed-size placement a very important topic in recen...
ICCAD
2006
IEEE
13 years 10 months ago
2006
IEEE
In addition to wirelength, modern placers need to consider various constraints such as preplaced blocks and density. We propose a high-quality analytical placement algorithm consi...