Case Study for Placement Solutions in ISPD11 and DAC12 Routability-Driven Placement Contests

摘要

Routability is a critical issue in VLSI design flow. To address this issue, the routability-driven placement contests held at ISPD11 and DAC12 promote the development of routability-driven placers such as those in. ISPD11 and DAC12 contests adopt metrics that are based on global routing solutions to evaluate the routability of placement solutions. However, such global-routing-based metrics typically ignore local congestion, and they cannot evaluate the actual routability effectively. In this work, we develop a translator that allows us to feed the placement solutions of mPL, NTUpIace, Ripple, and SimPLR into a commercial router for detailed routing. We then analyze the detailed routing result of each placement solution to better understand the issues that may cause routing violations. Moreover, we examine the suitability of using the ISPD11 and DAC12 metrics in predicting routability. Our findings indicated that the metrics might not reliably predict actual routability, in terms of the number of (detailed) routing violations.