Escaping Local Optima in Global Placement
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917600159596544 |
|---|---|
| author | Xue, Ke Lin, Xi Shi, Yunqi Kai, Shixiong Xu, Siyuan Qian, Chao |
| author_facet | Xue, Ke Lin, Xi Shi, Yunqi Kai, Shixiong Xu, Siyuan Qian, Chao |
| contents | Placement is crucial in the physical design, as it greatly affects power, performance, and area metrics. Recent advancements in analytical methods, such as DREAMPlace, have demonstrated impressive performance in global placement. However, DREAMPlace has some limitations, e.g., may not guarantee legalizable placements under the same settings, leading to fragile and unpredictable results. This paper highlights the main issue as being stuck in local optima, and proposes a hybrid optimization framework to efficiently escape the local optima, by perturbing the placement result iteratively. The proposed framework achieves significant improvements compared to state-of-the-art methods on two popular benchmarks. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2402_18311 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Escaping Local Optima in Global Placement Xue, Ke Lin, Xi Shi, Yunqi Kai, Shixiong Xu, Siyuan Qian, Chao Machine Learning Neural and Evolutionary Computing Placement is crucial in the physical design, as it greatly affects power, performance, and area metrics. Recent advancements in analytical methods, such as DREAMPlace, have demonstrated impressive performance in global placement. However, DREAMPlace has some limitations, e.g., may not guarantee legalizable placements under the same settings, leading to fragile and unpredictable results. This paper highlights the main issue as being stuck in local optima, and proposes a hybrid optimization framework to efficiently escape the local optima, by perturbing the placement result iteratively. The proposed framework achieves significant improvements compared to state-of-the-art methods on two popular benchmarks. |
| title | Escaping Local Optima in Global Placement |
| topic | Machine Learning Neural and Evolutionary Computing |
| url | https://arxiv.org/abs/2402.18311 |