skip to main content
10.1145/2228360.2228499acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article

GLARE: global and local wiring aware routability evaluation

Published:03 June 2012Publication History

ABSTRACT

Industry routers are very complex and time consuming, and are becoming more so with the explosion in design rules and design for manufacturability requirements that multiply with each technology node. Global routing is just the first phase of a router and serves the dual purpose of (i) seeding the following phases of a router and (ii) evaluating whether the current design point is routable. Lately, it has become common to use a "light mode" version of the global router, similar to today's academic routers, to quickly evaluate the routability of a given placement. This use model suffers from two primary weaknesses: (i) it does not adequately model the local routing resources, while the model is important to remove opens and shorts and eliminate DRC violations, (ii) the metrics used to represent congestion are non-intuitive and often fail to pinpoint the key issues that need to be addressed. This paper presents solutions to both issues, and empirically demonstrates that incorporating the proposed solutions within a global routing based congestion analyzer yields a more accurate view of design routability.

References

  1. C. Alpert et al. What makes a design difficult to route. In Proc. ISPD, pages 7--12, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. C. Alpert and G. Tellez. The importance of routing congestion analysis. DAC Knowledge Center Online Article, 2010. http://www.dac.com/back_end+topics.aspx?article=47&topic=2.Google ScholarGoogle Scholar
  3. Y.-J. Chang et al. NTHU-Route 2.0: A fast and stable global router. In Proc. ICCAD, pages 338--343, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. H.-Y. Chen et al. High-performance global routing with fast overflow reduction. In Proc. ASPDAC, pages 582--587, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. C. Chu and Y.-C. Wong. Flute: Fast lookup table based rectilinear Steiner minimal tree algorithm for VLSI design. IEEE Trans. on CAD, 27(1):70--83, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. J. Lou et al. Estimating routing congestion using probabilistic analysis. IEEE Trans. on CAD, 21(1):32--41, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. C. Minsik et al. BoxRouter 2.0: Architecture and implementation of a hybrid and robust global router. In Proc. ICCAD, pages 503--508, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. M. D. Moffitt. MaizeRouter: Engineering an effective global router. IEEE Trans. on CAD, 27(11):2017--2026, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. M. Pan and C. Chu. FastRoute: A step to integrate global routing into placement. In Proc. ICCAD, pages 464--471, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. M. Pan and C. Chu. IPR: An integrated placement and routing algorithm. In Proc. DAC, pages 59--62, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Roy et al. CRISP: Congestion reduction by iterated spreading during placement. In Proc. ICCAD, pages 357--362, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. H. Shojaei et al. Congestion analysis for global routing via integer programming. In Proc. ICCAD, pages 256--262, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Westra et al. Probabilistic congestion prediction. In Proc. ISPD, pages 204--209, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. T.-H. Wu et al. A parallel integer programming approach to global routing. In Proc. DAC, pages 194--199, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Y. Xu et al. FastRoute 4.0: Global router with efficient via minimization. In Proc. ASPDAC, pages 576--581, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. GLARE: global and local wiring aware routability evaluation

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        DAC '12: Proceedings of the 49th Annual Design Automation Conference
        June 2012
        1357 pages
        ISBN:9781450311991
        DOI:10.1145/2228360

        Copyright © 2012 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 3 June 2012

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate1,770of5,499submissions,32%

        Upcoming Conference

        DAC '24
        61st ACM/IEEE Design Automation Conference
        June 23 - 27, 2024
        San Francisco , CA , USA

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader