Gridless pin access in detailed routing
Author:
Open Access
- 5 June 2011
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 170-175
Abstract
In the physical design of VLSI circuits, routing is one of the most important tasks. Usually done towards the end of the design process, especially the detailed routing phase has to obey virtually all design rules. As the feature size become ever smaller, shifts towards gridless design paradigms are necessary and a formerly trivial task, namely pin access, now becomes difficult. This work presents and discusses gridless pin access. In particular, we show how to create a feasible and efficient gridless routing approach that can be fit into existing gridded routing flows, creating a practical overall routing solution. As a key ingredient, our approach explicitly addresses design rule conform (shortest) paths among geometric obstacles, also taking violations within the paths themselves into consideration. Furthermore, redundancy exploiting structures called circuitclasses are introduced, and based on these, further improvements are described. We evaluated the approach on current gridless designs and present respective results: the routing performance is improved greatly both with respect to runtime and quality of the results.Keywords
This publication has 8 references indexed in Scilit:
- What makes a design difficult to route2010
- Detailed-Routing Algorithms for Dense Pin Clusters in Integrated CircuitsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2009
- Multilevel Full-Chip Gridless Routing With Applications to Optical-Proximity CorrectionIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2007
- BonnTools: Mathematical Innovation for Layout and Timing Closure of Systems on a ChipProceedings of the IEEE, 2007
- Efficient escape routing for hexagonal array of high density I/Os2006
- MARS-a multilevel full-chip gridless routing systemIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2005
- Rectilinear paths among rectilinear obstaclesDiscrete Applied Mathematics, 1996
- On Steiner’s Problem with Rectilinear DistanceSIAM Journal on Applied Mathematics, 1966