File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Conference Paper: Power grid analysis with hierarchical support graphs

TitlePower grid analysis with hierarchical support graphs
Authors
Issue Date2011
Citation
IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, 2011, p. 543-547 How to Cite?
AbstractIt is increasingly challenging to analyze present day large-scale power delivery networks (PDNs) due to the drastically growing complexity in power grid design. To achieve greater runtime and memory efficiencies, a variety of preconditioned iterative algorithms has been investigated in the past few decades with promising performance, while incremental power grid analysis also becomes popular to facilitate fast re-simulations of corrected designs. Although existing preconditioned solvers, such as incomplete matrix factor-based preconditioners, usually exhibit high efficiency in memory usage, their convergence behaviors are not always satisfactory. In this work, we present a novel hierarchical support-graph preconditioned iterative algorithm that constructs preconditioners by generating spanning trees in power supply networks for fast power grid analysis. The support-graph preconditioner is efficient for handling complex power grid structures (regular or irregular grids), and can facilitate very fast incremental analysis. Our experimental results on IBM power grid benchmarks show that compared with the best direct or iterative solvers, the proposed support-graph preconditioned iterative solver achieves up to 3.6X speedups for DC analysis, and up to 22X speedups for incremental analysis, while reducing the memory consumption by a factor of four. © 2011 IEEE.
Persistent Identifierhttp://hdl.handle.net/10722/336102
ISSN
2023 SCImago Journal Rankings: 0.894

 

DC FieldValueLanguage
dc.contributor.authorZhao, Xueqian-
dc.contributor.authorWang, Jia-
dc.contributor.authorFeng, Zhuo-
dc.contributor.authorHu, Shiyan-
dc.date.accessioned2024-01-15T08:23:28Z-
dc.date.available2024-01-15T08:23:28Z-
dc.date.issued2011-
dc.identifier.citationIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD, 2011, p. 543-547-
dc.identifier.issn1092-3152-
dc.identifier.urihttp://hdl.handle.net/10722/336102-
dc.description.abstractIt is increasingly challenging to analyze present day large-scale power delivery networks (PDNs) due to the drastically growing complexity in power grid design. To achieve greater runtime and memory efficiencies, a variety of preconditioned iterative algorithms has been investigated in the past few decades with promising performance, while incremental power grid analysis also becomes popular to facilitate fast re-simulations of corrected designs. Although existing preconditioned solvers, such as incomplete matrix factor-based preconditioners, usually exhibit high efficiency in memory usage, their convergence behaviors are not always satisfactory. In this work, we present a novel hierarchical support-graph preconditioned iterative algorithm that constructs preconditioners by generating spanning trees in power supply networks for fast power grid analysis. The support-graph preconditioner is efficient for handling complex power grid structures (regular or irregular grids), and can facilitate very fast incremental analysis. Our experimental results on IBM power grid benchmarks show that compared with the best direct or iterative solvers, the proposed support-graph preconditioned iterative solver achieves up to 3.6X speedups for DC analysis, and up to 22X speedups for incremental analysis, while reducing the memory consumption by a factor of four. © 2011 IEEE.-
dc.languageeng-
dc.relation.ispartofIEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD-
dc.titlePower grid analysis with hierarchical support graphs-
dc.typeConference_Paper-
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.doi10.1109/ICCAD.2011.6105383-
dc.identifier.scopuseid_2-s2.0-84862948892-
dc.identifier.spage543-
dc.identifier.epage547-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats