Theory and Algorithm of Local-Refinement Based Optimization with Application to Device and Interconnect Sizing (1999)
| Citations: | 7 - 7 self |
BibTeX
@MISC{Cong99theoryand,
author = {Jason Cong and Lei He},
title = {Theory and Algorithm of Local-Refinement Based Optimization with Application to Device and Interconnect Sizing},
year = {1999}
}
OpenURL
Abstract
In this paper we formulate three classes of optimization problems: the simple, monotonically-constrained, and bounded CH-programs. We reveal the dominance property under the local refinement (LR) operation for the simple CH-program, as well as the general dominance property under the pseudo-LR operation for the monotonically-constrained CH-program and the extended-LR operation for the bounded CH-program. These properties enable a very efficient polynomial-time algorithm, using different types of LR operations to compute tight lower and upper bounds of the exact solution to any CH-program. We show that the algorithm is capable of solving many layout optimization problems in deep submicron IC and/or high-performance MCM/PCB designs. In particular, we apply...







