Given the significance of placement in IC physical design, extensive research studies
performed over the last 50 years addressed numerous aspects of global and detailed …

The new era of cognitive computing brings forth the grand challenge of developing systems
capable of processing massive amounts of noisy multisensory data. This type of intelligent …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

This book provides broad and comprehensive coverage of the entire EDA flow. EDA/VLSI
practitioners and researchers in need of fluency in an" adjacent" field will find this an …

Classical floorplanning minimizes a linear combination of area and wirelength. When
simulated annealing is used, eg, with the sequence pair representation, the typical choice of …

We propose a self-contained, flat, quadratic global placer that is simpler than existing
placers and easier to integrate into timing-closure flows. It maintains lower-bound and upper …

In this paper, we present FastPlace--a fast, iterative, flat placement algorithm for large-scale
standard cell designs. FastPlace is based on the quadratic placement approach. The …

In this paper, we develop a new standard cell placement tool, Dragon2000, to solve large
scale placement problem effectively. A top-down hierarchical approach is used in …

Automated cell placement is a critical problem in VLSI physical design. New analytical
placement methods that simultaneously spread cells and optimize wirelength have recently …

In the past few years, there has been a lot of research in the area of global placement. In
comparison, not much attention has been paid to the detailed placement problem. Existing …