A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Fast min-cost buffer insertion under process variations
2007
Proceedings - Design Automation Conference
Process variation has become a critical problem in modern VLSI fabrication. In the presence of process variation, buffer insertion problem under performance constraints becomes more difficult since the solution space expands greatly. We propose efficient dynamic programming approaches to handle the min-cost buffer insertion under process variations. Our approaches handle delay constraints and slew constraints, in trees and in combinational circuits. The experimental results demonstrate that in
doi:10.1145/1278480.1278567
dblp:conf/dac/ChenZ07
fatcat:37fxkqoqtngnvim33b5jdsw5y4