2009 17th IEEE Symposium on Field Programmable Custom Computing Machines 2009
DOI: 10.1109/fccm.2009.23
|View full text |Cite
|
Sign up to set email alerts
|

Accelerating the Gauss-Seidel Power Flow Solver on a High Performance Reconfigurable Computer

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2012
2012
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 6 publications
(3 citation statements)
references
References 5 publications
0
3
0
Order By: Relevance
“…However, the convergence of Gauss-Seidel can be considered comparatively slow. In [23] an accelerated Gauss-Seidel implementation using FPGAs is presented. Their approach is not compatible with the requirement for a decentralized power-flow calculation as mentioned above.…”
Section: Computation Of Power-flowmentioning
confidence: 99%
“…However, the convergence of Gauss-Seidel can be considered comparatively slow. In [23] an accelerated Gauss-Seidel implementation using FPGAs is presented. Their approach is not compatible with the requirement for a decentralized power-flow calculation as mentioned above.…”
Section: Computation Of Power-flowmentioning
confidence: 99%
“…Byun et al [31] showed that a 200 000bus node requires 67.64 s to simulate. They reached a 62× speedup using a field programmable gate array (FPGA) implementation.…”
Section: ) Dependency Graphmentioning
confidence: 99%
“…Parallel processing schemes were exploited in [16][17][18][19][20][21] to accelerate the computation of the power flow solution. In [22][23][24], different versions of the generalized minimal residual method equipped with some accelerating schemes were used to speed up the traditional Newton method.…”
Section: Introductionmentioning
confidence: 99%