Recursive Learning-Based Virtual Buffering for Analytical Global Placement
Andrew B. Kahng, Yiting Liu, Zhiang Wang

TL;DR
This paper introduces MLBuf-RePlAce, an open-source, learning-driven global placement framework that efficiently predicts buffer placement to improve timing closure without power degradation.
Contribution
It presents the first recursive learning-based virtual buffering approach integrated into an open-source global placer, addressing ERC violations and improving timing closure.
Findings
Achieves up to 56% maximum improvement in total negative slack (TNS).
Improves post-route power by an average of 0.2%.
Demonstrates effectiveness within open-source and commercial flows.
Abstract
Due to the skewed scaling of interconnect versus cell delay in modern technology nodes, placement with buffer porosity (i.e., cell density) awareness is essential for timing closure in physical synthesis flows. However, existing approaches face two key challenges: (i) traditional van Ginneken-Lillis-style buffering approaches are computationally expensive during global placement; and (ii) machine learning-based approaches, such as BufFormer, lack a thorough consideration of Electrical Rule Check (ERC) violations and fail to "close the loop" back into the physical design flow. In this work, we propose MLBuf-RePlAce, the first open-source learning-driven virtual buffering-aware analytical global placement framework, built on top of the OpenROAD infrastructure. MLBuf-RePlAce adopts an efficient recursive learning-based generative buffering approach to predict buffer types and locations,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
