Presentation
Late Breaking Results: A Fully Differentiable Rectilinear Minimum Spanning Tree Wirelength Model for Global Placement
DescriptionGlobal placement relies heavily on differentiable wirelength models to guide the optimization process. While the half-perimeter wirelength is gold standard due to its computational efficiency and smooth approximations, it suffers from a significant fidelity gap as it fails to capture the internal routing topology of multi-pin nets. In this paper, we propose a novel differentiable wirelength model based on the rectilinear minimum spanning tree (RMST). By leveraging the matrix-tree theorem and the log-sum-exp function, we transform the combinatorial RMST problem into a smooth, continuous objective suitable for global placement. Experimental results demonstrate that our model significantly reduces the fidelity gap, achieving a 3.4% reduction in RMST wirelength and a 3.2% reduction in routed wirelength compared to the widely used HPWL-based baseline, while maintaining acceptable runtime.
Event Type
Late Breaking Results
TimeMonday, July 276:30pm - 6:34pm PDT
LocationExhibit Hall
Similar Presentations