ACM Home Page
Please provide us with feedback. Feedback
Digital Library logoTake a look at the new version of this page: [ beta version ]. Tell us what you think.
Highly efficient gradient computation for density-constrained analytical placement methods
Full text PdfPdf (351 KB)
Source
International Symposium on Physical Design archive
Proceedings of the 2008 international symposium on Physical design table of contents
Portland, Oregon, USA
SESSION: Advances in placement table of contents
Pages: 39-46  
Year of Publication: 2008
ISBN:978-1-60558-048-7
Authors
Jason Cong  University of California: Los Angeles, Los Angeles, CA, USA
Guojie Luo  University of California: Los Angeles, Los Angeles, CA, USA
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 44,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1353629.1353639
What is a DOI?

ABSTRACT

Recent analytical global placers use density constraints to approximate non-overlap constraints and show very successful results. In this paper we unify a wide range of density smoothing techniques that we call global smoothing, and present a highly efficient method to compute the gradient of such smoothed densities used in several well-known analytical placers [3, 5, 7]. Our method reduces the complexity of the gradient computation by a factor of n compared to a naïve method, where n is the number of modules. Furthermore, with this efficient gradient computation we can come up with an efficient nonlinear programming-based placement framework, which supercedes the existing force-directed placement methods [4, 7]. An application of our technique, as the engine of a multilevel placer, achieved 13% and 15% wirelength improvement compared with SCAMPI [13] and mPL6 [3] on IBM-HB+ benchmark [13]


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
K. Arrow, L. Huriwicz, and H. Uzawa. Studies in Nonlinear Programming, Stanford University Press, Stanford, CA, 1958.
3
4
5
 
6
7
 
8
 
9
10
11
 
12
W. C. Naylor, R. Donelly, and L. Sha, Non-linear Optimization System and Method for Wire Length and Delay Optimization for an Automatic Electric Circuit Placer, US Patent 6301693, October 2001.
13
 
14
J. Nocedal and S. J. Wright. Numerical Optimization 2nd ed., Springer, 2006.
 
15
A. D. Polyanin. Handbook of Linear Partial Differential Equations for Engineers and Scientists, Chapman & Hall/CRC, 2002.
16