2020
DOI: 10.1109/tsg.2019.2943746
|View full text |Cite
|
Sign up to set email alerts
|

Full Parallel Power Flow Solution: A GPU-CPU-Based Vectorization Parallelization and Sparse Techniques for Newton–Raphson Implementation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
2

Citation Types

0
26
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
1
1
1

Relationship

0
9

Authors

Journals

citations
Cited by 32 publications
(26 citation statements)
references
References 27 publications
0
26
0
Order By: Relevance
“…In the case of highly meshed networks, the impedance matrix is computed using LU factorization. Several software packages exist, which can efficiently solve sparse matrices of large systems e.g KLU solver [32], [33]. Moreover, with the rapid progress of parallel computing, GPU-based parallel LU factorization solvers can complete the LU factorization of matrices with many thousands (even billion) of elements in a few milliseconds [31], [32].…”
Section: Applicability In Large Networkmentioning
confidence: 99%
“…In the case of highly meshed networks, the impedance matrix is computed using LU factorization. Several software packages exist, which can efficiently solve sparse matrices of large systems e.g KLU solver [32], [33]. Moreover, with the rapid progress of parallel computing, GPU-based parallel LU factorization solvers can complete the LU factorization of matrices with many thousands (even billion) of elements in a few milliseconds [31], [32].…”
Section: Applicability In Large Networkmentioning
confidence: 99%
“…In [61], a GPU-accelerated algorithm was proposed that could handle largescale MCS-SRS for PFF computation. There are some studies focusing on the CPU-GPU hybrid system [62,63]. In [62], an advanced PF computation technique was proposed.…”
Section: Gpu Applications Trends In Pf Studiesmentioning
confidence: 99%
“…There are some studies focusing on the CPU-GPU hybrid system [62,63]. In [62], an advanced PF computation technique was proposed. This technique is based on the CPU-GPU hybrid system, vectorization parallelization, and sparse techniques.…”
Section: Gpu Applications Trends In Pf Studiesmentioning
confidence: 99%
“…In the case of highly meshed networks, the impedance matrix is computed using LU factorization. Several software packages exist, which can efficiently solve sparse matrices of large systems e.g KLU solver [32], [33]. Moreover, with the rapid progress of parallel computing, GPU-based parallel LU factorization solvers can complete the LU factorization of matrices with many thousands (even billion) of elements in a few milliseconds [31], [32].…”
Section: Applicability In Large Networkmentioning
confidence: 99%