skip to main content
10.1145/3061639.3062193acmconferencesArticle/Chapter ViewAbstractPublication PagesdacConference Proceedingsconference-collections
research-article
Public Access

A Spectral Graph Sparsification Approach to Scalable Vectorless Power Grid Integrity Verification

Authors Info & Claims
Published:18 June 2017Publication History

ABSTRACT

Vectorless integrity verification is becoming increasingly critical to robust design of nanoscale power delivery networks (PDNs). To dramatically improve efficiency and capability of vectorless integrity verifications, this paper introduces a scalable multilevel integrity verification framework by leveraging a hierarchy of almost linear-sized spectral power grid sparsifiers that can well retain effective resistances between nodes, as well as a recent graph-theoretic algebraic multigrid (AMG) algorithmic framework. As a result, vectorless integrity verification solution obtained on coarse level problems can effectively help find the solution of the original problem. Extensive experimental results show that the proposed vectorless verification framework can always efficiently and accurately obtain worst-case scenarios in even very large power grid designs.

References

  1. J. Batson, D. Spielman, N. Srivastava, and S. Teng. 2013. Spectral sparsiflcation of graphs: theory and algorithms. Commun. ACM 56, 8 (2013), 87--94. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. D. Kouroussis and I. Ferzli and F. Najm. 2005. Incremental partitioning-based vectorless power grid verification. In Proc. IEEE/ACM ICCAD. 358--364. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Z. Feng. 2013. Scalable Multilevel Vectorless Power Grid Voltage Integrity Verification. IEEE Trans. on VLSI Systems 21, 8 (August 2013), 1526--1539. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Z. Feng. 2013. Scalable Vectorless Power Grid Current Integrity Verification. In Proc. of IEEE/ACM DAC. 86:1--86:8. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Z. Feng. 2016. Spectral Graph Sparsification in Nearly-Linear Time Leveraging Efficient Spectral Perturbation Analysis. In Proc. IEEE/ACM DAC. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. N. Ghani and F. Najm. 2009. Fast Vectorless Power Grid Verification Using an Approximate Inverse Technique. In Proc. IEEE/ACM DAC. 184--189. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. A. Goyal and F. Najm. 2011. Efficient RC power grid verification using node elimination. In Proc. of IEEE/ACM DATE. 257--260.Google ScholarGoogle Scholar
  8. D. Kouroussis and F. Najm. 2003. A static pattern-independent technique for power grid voltage integrity verification. In Proc. IEEE/ACM DAC. 99--104. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. R. Lewis and S. Nash. 2005. Model Problems for the Multigrid Optimization of Systems Governed by Differential Equations. SIAM J. Sci. Comput. 26, 6 (2005), 1811--1837. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. O. Livne and A. Brandt. 2012. Lean algebraic multigrid (LAMG): Fast graph Laplacian linear solver. SIAM Journal on Scientific Computing 34, 4 (2012), B499--B522.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. F. Najm. 2012. Overview of vectorless/early power grid verification. In Proc. of IEEE/ACM ICCAD. 670--677. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. S. R. Nassif. 2008. IBM power grid benchmarks. {Online}. Available: http://dropzone.tamu.edu/pli/PGBench/.Google ScholarGoogle Scholar
  13. Gurobi Optimization. 2016. Gurobi optimizer {Online}. Available: www.gurobi.com. (2016).Google ScholarGoogle Scholar
  14. H. Qian, S. R. Nassif, and S. S. Sapatnekar. 2005. Early-stage power grid analysis for uncertain working modes. IEEE Trans. on Computer-Aided Design 24, 5 (2005), 676--682. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. D. Spielman and N. Srivastava. 2008. Graph sparsiflcation by effective resistances. In Proc. ACM STOC. 563--568. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. D. Spielman and S. Teng. 2011. Spectral sparsiflcation of graphs. SIAM J. Comput. 40,4(2011), 981--1025. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. X. Xiong and J. Wang. 2010. An Efficient Dual Algorithm for Vectorless Power Grid Verification under Linear Current Constraints. In Proc. IEEE/ACM DAC. 837--842. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. J. Yang and Z. Li. THU power grid benchmarks. {Online}. Available: http://tiger.cs.tsinghua.edu.cn/PGBench/.Google ScholarGoogle Scholar
  19. X. Zhao, Z. Feng, and C. Zhuo. 2014. An efficient spectral graph sparsiflcation approach to scalable reduction of large flip-chip power grids. In Proceedings of the 2014 IEEE/ACM International Conference on Computer-Aided Design. IEEE Press, 218--223. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. A Spectral Graph Sparsification Approach to Scalable Vectorless Power Grid Integrity Verification

      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 '17: Proceedings of the 54th Annual Design Automation Conference 2017
        June 2017
        533 pages
        ISBN:9781450349277
        DOI:10.1145/3061639

        Copyright © 2017 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: 18 June 2017

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Research
        • Refereed limited

        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