English

GOALPlace: Begin with the End in Mind

Machine Learning 2024-07-08 v1

Abstract

Co-optimizing placement with congestion is integral to achieving high-quality designs. This paper presents GOALPlace, a new learning-based general approach to improving placement congestion by controlling cell density. Our method efficiently learns from an EDA tool's post-route optimized results and uses an empirical Bayes technique to adapt this goal/target to a specific placer's solutions, effectively beginning with the end in mind. It enhances correlation with the long-running heuristics of the tool's router and timing-opt engine -- while solving placement globally without expensive incremental congestion estimation and mitigation methods. A statistical analysis with a new hierarchical netlist clustering establishes the importance of density and the potential for an adequate cell density target across placements. Our experiments show that our method, integrated as a demonstration inside an academic GPU-accelerated global placer, consistently produces macro and standard cell placements of superior or comparable quality to commercial tools. Our empirical Bayes methodology also allows a substantial quality improvement over state-of-the-art academic mixed-size placers, achieving up to 10x fewer design rule check (DRC) violations, a 5% decrease in wirelength, and a 30% and 60% reduction in worst and total negative slack (WNS/TNS).

Keywords

Cite

@article{arxiv.2407.04579,
  title  = {GOALPlace: Begin with the End in Mind},
  author = {Anthony Agnesina and Rongjian Liang and Geraldo Pradipta and Anand Rajaram and Haoxing Ren},
  journal= {arXiv preprint arXiv:2407.04579},
  year   = {2024}
}

Comments

10 pages, 7 figures, preprint

R2 v1 2026-06-28T17:30:25.306Z