Learn More
We propose a new multilevel framework for large-scale placement called MAPLE that respects utilization constraints, handles movable macros and guides the transition between global and detailed placement. In this framework, optimization is adaptive to current placement conditions through a new density metric. As a baseline, we leverage a recently developed(More)
Local routing congestion is becoming increasingly important as complex design rules make local pin access the bottle-neck for modern designs and routers. Since congestion analysis based on global routing does not model these effects, routability-driven placement and physical synthesis fail to alleviate local congestion. This work models routing congestion(More)
Timing-driven placement is a critical step in nanometer-scale physical synthesis. To improve design timing on a global scale, net-weight based global timing-driven placement is a commonly used technique. This paper shows that such an approach can improve timing, but often degrades wire length and routability. Another problem with existing timing-driven(More)
VLSI chips design is becoming increasingly complex and calling for more and more automation. Many chip design problems can be formulated naturally as constraint problems and are potentially amenable to CP techniques. To the best of our knowledge, though, there has been little CP work in this domain to date. We describe a successful application of a CP based(More)
The growing complexity and size of designs have driven chip implementation teams to adopt hierarchical design methodologies that divide-and-conquer the design closure task. Wherein, the large chip is partitioned into physical blocks with boundary constraints for physical synthesis which are then integrated at the top-level to achieve overall design closure.(More)
Traditionally placement evaluation metrics have been based on wirelength and congestion measures and are independent of the logic network topology. However, the actual timing measure, which is used in a design closure loop, is path-based and dependent on the network topology. In this paper, we propose a design-topology aware metric that encapsulates the(More)
  • 1