4.7 Article

GPU-Accelerated Algorithm for Online Probabilistic Power Flow

Journal

IEEE TRANSACTIONS ON POWER SYSTEMS
Volume 33, Issue 1, Pages 1132-1135

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TPWRS.2017.2756339

Keywords

GPU; probabilistic power flow; Monte-Carlo simulation; simple random sampling; uncertainty source; online

Funding

  1. Science and Technology Foundation of State Grid Corporation of China [DZ71-16-028]
  2. Jiangsu Province Natural Science Fund [BK20151124]
  3. Jiangsu Key Laboratory of Smart Grid Technology and Equipment

Ask authors/readers for more resources

This letter proposes a superior GPU-accelerated algorithm for probabilistic power flow (PPF) based on Monte-Carlo simulation with simple random sampling (MCS-SRS). By means of offloading the tremendous computational burden to GPU, the algorithm can solve PPF in an extremely fast manner, two orders of magnitude faster in comparison to its CPU-based counterpart. Case studies on three large-scale systems show that the proposed algorithm can solve a whole PPF analysis with 10000 SRS and ultra-high-dimensional dependent uncertainty sources in seconds and therefore presents a highly promising solution for online PPF applications.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available