Locality-Driven Parallel Static Analysis for Power Delivery Networks

Handle URI:
http://hdl.handle.net/10754/598226
Title:
Locality-Driven Parallel Static Analysis for Power Delivery Networks
Authors:
Zeng, Zhiyu; Feng, Zhuo; Li, Peng; Sarin, Vivek
Abstract:
Large VLSI on-chip Power Delivery Networks (PDNs) are challenging to analyze due to the sheer network complexity. In this article, a novel parallel partitioning-based PDN analysis approach is presented. We use the boundary circuit responses of each partition to divide the full grid simulation problem into a set of independent subgrid simulation problems. Instead of solving exact boundary circuit responses, a more efficient scheme is proposed to provide near-exact approximation to the boundary circuit responses by exploiting the spatial locality of the flip-chip-type power grids. This scheme is also used in a block-based iterative error reduction process to achieve fast convergence. Detailed computational cost analysis and performance modeling is carried out to determine the optimal (or near-optimal) number of partitions for parallel implementation. Through the analysis of several large power grids, the proposed approach is shown to have excellent parallel efficiency, fast convergence, and favorable scalability. Our approach can solve a 16-million-node power grid in 18 seconds on an IBM p5-575 processing node with 16 Power5+ processors, which is 18.8X faster than a state-of-the-art direct solver. © 2011 ACM.
Citation:
Zeng Z, Feng Z, Li P, Sarin V (2011) Locality-Driven Parallel Static Analysis for Power Delivery Networks. TODAES 16: 1–17. Available: http://dx.doi.org/10.1145/1970353.1970361.
Publisher:
Association for Computing Machinery (ACM)
Journal:
ACM Transactions on Design Automation of Electronic Systems
KAUST Grant Number:
KUS-C1-016-04
Issue Date:
1-Jun-2011
DOI:
10.1145/1970353.1970361
Type:
Article
ISSN:
1084-4309
Sponsors:
This material is based on work supported by the National Science Foundation under grant no. 0903485 and grant no. 0747423, and SRC under contract 2009-TJ-1987. It is also based on work supported by award number KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST).
Appears in Collections:
Publications Acknowledging KAUST Support

Full metadata record

DC FieldValue Language
dc.contributor.authorZeng, Zhiyuen
dc.contributor.authorFeng, Zhuoen
dc.contributor.authorLi, Pengen
dc.contributor.authorSarin, Viveken
dc.date.accessioned2016-02-25T13:39:58Zen
dc.date.available2016-02-25T13:39:58Zen
dc.date.issued2011-06-01en
dc.identifier.citationZeng Z, Feng Z, Li P, Sarin V (2011) Locality-Driven Parallel Static Analysis for Power Delivery Networks. TODAES 16: 1–17. Available: http://dx.doi.org/10.1145/1970353.1970361.en
dc.identifier.issn1084-4309en
dc.identifier.doi10.1145/1970353.1970361en
dc.identifier.urihttp://hdl.handle.net/10754/598226en
dc.description.abstractLarge VLSI on-chip Power Delivery Networks (PDNs) are challenging to analyze due to the sheer network complexity. In this article, a novel parallel partitioning-based PDN analysis approach is presented. We use the boundary circuit responses of each partition to divide the full grid simulation problem into a set of independent subgrid simulation problems. Instead of solving exact boundary circuit responses, a more efficient scheme is proposed to provide near-exact approximation to the boundary circuit responses by exploiting the spatial locality of the flip-chip-type power grids. This scheme is also used in a block-based iterative error reduction process to achieve fast convergence. Detailed computational cost analysis and performance modeling is carried out to determine the optimal (or near-optimal) number of partitions for parallel implementation. Through the analysis of several large power grids, the proposed approach is shown to have excellent parallel efficiency, fast convergence, and favorable scalability. Our approach can solve a 16-million-node power grid in 18 seconds on an IBM p5-575 processing node with 16 Power5+ processors, which is 18.8X faster than a state-of-the-art direct solver. © 2011 ACM.en
dc.description.sponsorshipThis material is based on work supported by the National Science Foundation under grant no. 0903485 and grant no. 0747423, and SRC under contract 2009-TJ-1987. It is also based on work supported by award number KUS-C1-016-04, made by King Abdullah University of Science and Technology (KAUST).en
dc.publisherAssociation for Computing Machinery (ACM)en
dc.subjectLocalityen
dc.subjectParallelen
dc.subjectPartitioning baseden
dc.subjectPower delivery networken
dc.subjectStatic analysisen
dc.titleLocality-Driven Parallel Static Analysis for Power Delivery Networksen
dc.typeArticleen
dc.identifier.journalACM Transactions on Design Automation of Electronic Systemsen
dc.contributor.institutionTexas A and M University, College Station, United Statesen
dc.contributor.institutionMichigan Technological University, Houghton, United Statesen
kaust.grant.numberKUS-C1-016-04en
All Items in KAUST are protected by copyright, with all rights reserved, unless otherwise indicated.