Name
Abstract | ||
|---|---|---|
We present a rigorous framework that defines a class of net weighting schemes in which unconstrained minimization is successively performed on a weighted objective. We show that, provided certain goals are met in the unconstrained minimization, these net weighting schemes are guaranteed to converge to the optimal solution of the original timing-constrained placement problem. These are the first results that provide conditions under which a net weighting scheme will converge to a timing optimal placement. We then identify several weighting schemes that satisfy the given convergence properties and implement them, with promising results: a modification of the weighting scheme given in [11]results in consistently improved delay over the original, 4% on average, without increase in computation time. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.1145/1687399.1687454 | ICCAD |
Keywords | Field | DocType |
convergence property,certain goal,unconstrained minimization,original timing-constrained placement problem,optimal solution,computation time,timing-driven placement,rigorous framework,weighting scheme,promising result,improved delay,timing optimal placement,design automation,data mining,convergence,benchmark testing,satisfiability,integrated circuit design,np complete | Convergence (routing),NP-complete,Mathematical optimization,Weighting,Computer science,Electronic design automation,Minification,Integrated circuit design,Benchmark (computing),Computation | Conference |
Citations | PageRank | References |
2 | 0.37 | 9 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tony F. Chan | 1 | 8733 | 659.77 |
| Jason Cong | 2 | 7069 | 515.06 |
| Eric Radke | 3 | 2 | 0.37 |