Thumbnail
Access Restriction
Subscribed

Author Lee, Dong-Jin ♦ Kim, Myung-Chul ♦ Markov, Igor L.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Abstract VLSI placement optimizes locations of circuit components so as to reduce interconnect. Formulated in terms of (hyper) graphs, it is NP-hard, and yet must be solved for challenging million-node instances within several hours. We propose an algorithm for large-scale placement that outperforms prior art both in runtime and solution quality on standard benchmarks. The algorithm is more straightforward than existing placers and easier to integrate into timing-closure flows. Our C++ implementation is compact, self-contained and exploits instruction-level and thread-level parallelism. Due to its simplicity and superior performance, the algorithm has been adopted in the industry and was extended by several university groups to multi-objective optimization.
Description Affiliation: University of Michigan, Ann Arbor (Kim, Myung-Chul; Lee, Dong-Jin; Markov, Igor L.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 56
Issue Number 6
Page Count 9
Starting Page 105
Ending Page 113


Open content in new tab

   Open content in new tab
Source: ACM Digital Library