Sciweavers

Share
DAC
2008
ACM

Path smoothing via discrete optimization

9 years 3 months ago
Path smoothing via discrete optimization
A fundamental problem in timing-driven physical synthesis is the reduction of critical paths in a design. In this work, we propose a powerful new technique that moves (and can also resize) multiple cells simultaneously to smooth critical paths, thereby reducing delay and improving worst negative slack or a figure-of-merit. Our approach offers several key advantages over previous formulations, including the accurate modeling of objectives and constraints in the true timing model, and a guarantee of legality for all cell locations. Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids ? placement and routing J.6 [Computer-Aided Engineering]: Computer-Aided Design G.4 [Mathematical Software]: Algorithm Design and Analysis General Terms: Algorithms, Design, Performance.
Michael D. Moffitt, David A. Papa, Zhuo Li, Charle
Added 12 Nov 2009
Updated 12 Nov 2009
Type Conference
Year 2008
Where DAC
Authors Michael D. Moffitt, David A. Papa, Zhuo Li, Charles J. Alpert
Comments (0)
books