Sciweavers

Share
ISPD
2000
ACM

A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization

10 years 4 months ago
A hybrid dynamic/quadratic programming algorithm for interconnect tree optimization
In this paper, we present an algorithm for delay minimization of interconnect trees by simultaneous buffer insertion/sizing and wire sizing. The algorithm integrates the quadratic programming approach to handle a wire branch [1] into the dynamic programming framework [2]. Our experimental results show that our hybrid dynamic/quadratic programming algorithm is faster, more accurate, and uses much less memory than the pure dynamic programming approach.
Yu-Yen Mo, Chris C. N. Chu
Added 01 Aug 2010
Updated 01 Aug 2010
Type Conference
Year 2000
Where ISPD
Authors Yu-Yen Mo, Chris C. N. Chu
Comments (0)
books