Visible to the public A Fast Layer Elimination Approach for Power Grid Reduction

TitleA Fast Layer Elimination Approach for Power Grid Reduction
Publication TypeConference Paper
Year of Publication2016
AuthorsYassine, Abdul-Amir, Najm, Farid N.
Conference NameProceedings of the 35th International Conference on Computer-Aided Design
PublisherACM
Conference LocationNew York, NY, USA
ISBN Number978-1-4503-4466-1
Keywordscompositionality, graph sparsification, Metrics, model order reduction, power grid, pubcrawl, Resiliency, Scalability, scalable verification
Abstract

Simulation and verification of the on-die power delivery network (PDN) is one of the key steps in the design of integrated circuits (ICs). With the very large sizes of modern grids, verification of PDNs has become very expensive and a host of techniques for faster simulation and grid model approximation have been proposed. These include topological node elimination, as in TICER and full-blown numerical model order reduction (MOR) as in PRIMA and related methods. However, both of these traditional approaches suffer from certain drawbacks that make them expensive and limit their scalability to very large grids. In this paper, we propose a novel technique for grid reduction that is a hybrid of both approaches--the method is numerical but also factors in grid topology. It works by eliminating whole internal layers of the grid at a time, while aiming to preserve the dynamic behavior of the resulting reduced grid. Effectively, instead of traditional node-by-node topological elimination we provide a numerical layer-by-layer block-matrix approach that is both fast and accurate. Experimental results show that this technique is capable of handling very large power grids and provides a 4.25x speed-up in transient analysis.

URLhttp://doi.acm.org/10.1145/2966986.2966989
DOI10.1145/2966986.2966989
Citation Keyyassine_fast_2016