Abstract
In this paper, a timing-driven genetic placer for standard-cell IC design is presented. The objective of the placer comprises minimizing both area and path delays. The objective function is such that when the algorithm starts converging toward generations with acceptable delay properties, the objective is dynamically adjusted toward optimizing area and wire length. Experiments with benchmark tests demonstrate delay performance improvement by up to 20%. It is also shown that sizable reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search hits a plateau. This reduction in runtime is achieved without any noticeable loss in solution quality.
| Original language | English |
|---|---|
| Pages (from-to) | 3-14 |
| Number of pages | 12 |
| Journal | Computer Systems Science and Engineering |
| Volume | 14 |
| Issue number | 1 |
| State | Published - 1999 |
Keywords
- Combinatorial optimization
- Critical paths
- Genetic algorithm
- Interconnect delay estimation
- Physical design
- Placement
- Standard-cell layout
- Timing prediction
- Timing verification
- Timing-driven placement
- VLSI
ASJC Scopus subject areas
- Control and Systems Engineering
- Theoretical Computer Science
- General Computer Science
Fingerprint
Dive into the research topics of 'Timing driven genetic placement'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver