Fast static analysis of power grids: Algorithms and implementations

Zhiyu Zeng, Tong Xu, Z. Feng, Peng Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

Large VLSI on-chip power delivery networks (PDN) are challenging to analyze due to sheer network complexity. In this paper, three power grid solvers developed in our group: a direct solver using Cholesky decomposition, a GPU-based multigrid preconditioning solver, and a partitioning-based solver using spatial locality, are reviewed. Following the requirements of TAU 2011 Power Grid Simulation Contest, single-threaded versions of these solvers are implemented and their performances are evaluated in terms of runtime, memory, maximum error and average error. The experimental results show that for the published IBM power grid benchmarks, the direct solver has the best overall performance among the three.

Original languageEnglish
Title of host publication2011 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2011
Pages488-493
Number of pages6
DOIs
StatePublished - 2011
Event2011 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2011 - San Jose, CA, United States
Duration: 7 Nov 201110 Nov 2011

Publication series

NameIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD
ISSN (Print)1092-3152

Conference

Conference2011 IEEE/ACM International Conference on Computer-Aided Design, ICCAD 2011
Country/TerritoryUnited States
CitySan Jose, CA
Period7/11/1110/11/11

Keywords

  • Cholesky decomposition
  • GPU
  • Power delivery network
  • locality
  • multigrid
  • partition
  • preconditioned conjugate gradient
  • static analysis

Fingerprint

Dive into the research topics of 'Fast static analysis of power grids: Algorithms and implementations'. Together they form a unique fingerprint.

Cite this