.png){kind=icon}
.png){kind=icon}
Return
SimPL: An Algorithm for Placing VLSI Circuits
.png){kind=icon}
PRE
AI
DOI：10.1145/2461256.2461279.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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.
Keywords:
PLACEMENT
Journal
IF:
12.2
Papers:
1.2W
Citations:
3.7W