Proceedings of the International Conference on Computer-Aided Design 2012
DOI: 10.1145/2429384.2429466
|View full text |Cite
|
Sign up to set email alerts
|

Fast transform-based preconditioners for large-scale power grid analysis on massively parallel architectures

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 6 publications
(2 citation statements)
references
References 20 publications
0
2
0
Order By: Relevance
“…On the other hand, iterative solvers, which mainly depend on simple operations such as matrixvector multiplication and inner product of vectors, are more amicable for parallelization, especially on GPU platforms. There are some newly published papers, such as [14,10,37,40,39], which confirm the practicality and effectiveness of iterative solvers in solving large linear dynamic networks like power grid networks.…”
Section: Introductionmentioning
confidence: 81%
“…On the other hand, iterative solvers, which mainly depend on simple operations such as matrixvector multiplication and inner product of vectors, are more amicable for parallelization, especially on GPU platforms. There are some newly published papers, such as [14,10,37,40,39], which confirm the practicality and effectiveness of iterative solvers in solving large linear dynamic networks like power grid networks.…”
Section: Introductionmentioning
confidence: 81%
“…When the memory usage of the solver is beyond the capacity of a single machine, hierarchical analysis [21] can be applied to partition the power grid and to distribute the job to multiple machines. For DC analysis where a single time step is of concern, parallel solvers exploiting various feature of power grids and leveraging advanced numerical methods including multigrid [5], [6], fast transform [3], and additive Schwarz method [14], [20] have shown great success over direct solvers based on LU decomposition in both memory usage and running time. However, for transient analysis where the LU decompositions are usually computed at the very beginning, it is very difficult to achieve speed-ups in comparison to the direct solvers when there is enough memory since only a pair of forward and back substitutions are necessary at each time step [12].…”
Section: Introductionmentioning
confidence: 99%