What's So Hard About (Mixed-Size) Placement?-Reference-Cited by-同舟云学术

What's So Hard About (Mixed-Size) Placement?

Published:2022-04-13 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2022 International Symposium on Physical Design
language:
Short-container-title:

Author:

Khasawneh Mohammad¹,Madden Patrick H.²

Affiliation:

1. SUNY Binghamton CSD & MathWorks, Binghamton, NY, USA

2. SUNY Binghamton CSD, Binghamton, NY, USA

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3505170.3511035

Reference30 articles.

1. Optimization by Simulated Annealing

2. An Efficient Heuristic Procedure for Partitioning Graphs

3. A. Mirhoseini , A. Goldie , M. Yazgan , J. W. Jiang , E. Songhori , S. Wang , Y.-J. Lee , E. Johnson , O. Pathak , A. Nazi , J. Pak , A. Tong , K. Srinivasa , W. Hang , and E. Tuncer . A graph placement methodology for fast chip design. Nature, 594(June 2021):207--212 , 2021 . A. Mirhoseini, A. Goldie, M. Yazgan, J. W. Jiang, E. Songhori, S. Wang, Y.-J. Lee, E. Johnson, O. Pathak, A. Nazi, J. Pak, A. Tong, K. Srinivasa, W. Hang, and E. Tuncer. A graph placement methodology for fast chip design. Nature, 594(June 2021):207--212, 2021.

4. M. R. Garey and D. S. Johnson . Computers and Intractibility: A Guide to the Theory of NP-Completeness . W.H. Freeman and Co. ,San Francisco, CA, 1979 . page 209 . M. R. Garey and D. S. Johnson. Computers and Intractibility: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co.,San Francisco, CA, 1979. page 209.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. RL-Legalizer: Reinforcement Learning-based Cell Priority Optimization in Mixed-Height Standard Cell Legalization;2023 Design, Automation & Test in Europe Conference & Exhibition (DATE);2023-04