Pin accessibility-driven detailed placement refinement

47Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The significantly increased number of routing design rules at sub-20nm nodes has made pin access one of the most critical challenges in detailed routing. Resolving pin access issues in detailed routing stage may be too late due to the fixed pin locations, especially in the area with high pin density. In placement stage when cell movement is allowed, the consideration of pin access has more flexibility. We propose a refinement stage after detailed placement to improve pin access. To respect the given placement solution, the refinement techniques are restricted to cell flipping, same-row adjacent cell swap, and cell shifting. A cost function is presented to model pin access for each pin-to-pin connection. Based on the cost function, two phases are proposed to improve pin access for all the connections simultaneously. In the first phase, we refine the placement by cell flipping and same-row adjacent cell swap. The problem is solved by dynamic programming row by row. In the second phase, only cell shifting is used, and a linear program is formulated to further refine the placement. Experimental results demonstrate that the proposed detailed placement refinement can improve pin access and reduce unroutable nets by about 33% in the detailed routing stage.

Cite

CITATION STYLE

APA

Ding, Y., Chu, C., & Mak, W. K. (2017). Pin accessibility-driven detailed placement refinement. In Proceedings of the International Symposium on Physical Design (Vol. Part F127197, pp. 133–140). Association for Computing Machinery. https://doi.org/10.1145/3036669.3036679

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free