Efficient simulation of power grids

Authors:
João M. S. Silva;Joel R. Phillips;Luís Miguel Silveira
Affiliations:
Synopsys, Mountain View, CA;Cadence Design Systems, Berkeley, CA;INESC ID, The Systems and Computers Engineering Institute, Research and Development, Instituto Superior Técnico, Technical University of Lisbon, Lisbon, Portugal
Venue:
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009
Year:
2010

Citing 16
Cited 2

A fast algorithm for particle simulations

Journal of Computational Physics
Multilevel hypergraph partitioning: applications in VLSI domain

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A sparse matrix arithmetic based on H-matrices. Part I: introduction to H-matrices

Computing
Modifying a Sparse Cholesky Factorization

SIAM Journal on Matrix Analysis and Applications
A sparse H -matrix arithmetic. Part II: application to multi-dimensional problems

Computing
Fast power grid simulation

Proceedings of the 37th Annual Design Automation Conference
Efficient large-scale power grid analysis based on preconditioned krylov-subspace iterative methods

Proceedings of the 38th annual Design Automation Conference
Multiple-Rank Modifications of a Sparse Cholesky Factorization

SIAM Journal on Matrix Analysis and Applications
A static pattern-independent technique for power grid voltage integrity verification

Proceedings of the 40th annual Design Automation Conference
Power network analysis using an adaptive algebraic multigrid approach

Proceedings of the 40th annual Design Automation Conference
Construction and arithmetics of H-matrices

Computing
Row Modifications of a Sparse Cholesky Factorization

SIAM Journal on Matrix Analysis and Applications
Hierarchical LU Decomposition-based Preconditioners for BEM

Computing
Power grid physics and implications for CAD

Proceedings of the 43rd annual Design Automation Conference
Power grid analysis benchmarks

Proceedings of the 2008 Asia and South Pacific Design Automation Conference
A multigrid-like technique for power grid analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

PowerRush: a linear simulator for power grid

Proceedings of the International Conference on Computer-Aided Design
Fast Poisson solver preconditioned method for robust power grid analysis

Proceedings of the International Conference on Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modern deep sub-micron ultra-large scale integration designs with hundreds of millions of devices require huge grids for power distribution. Such grids, operating with decreasing power supply voltages, are a design limiting factor and accurate analysis of their behavior is of paramount importance as any voltage drops can seriously impact performance or functionality. As power grid models have millions of unknowns, highly optimized special-purpose simulation tools are required to handle the time and memory complexity of solving for their dynamic behavior. In this paper, we propose a hierarchical matrix representation of the power grid model that is both space and time efficient. With this representation, reduced storage matrix factors are efficiently computed and applied in the analysis at every time-step of the simulation. Results show an almost linear complexity growth, namely O(n loga(n)), for some small constant a, in both space and time, when using this matrix representation. Comparisons of our academic implementation with production-quality code prove this method to be very efficient when dealing with the simulation of large power grid models.