.png){kind=icon}
返回
GPU-Based Batch LU-Factorization Solver for Concurrent Analysis of Massive Power Flows
.png){kind=icon}
PRE
AI
DOI：10.1109/TPWRS.2017.2662322.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Inmany power system applications, such as N-x static security analysis and Monte-Carlo-simulation-based probabilistic power flow (PF) analysis, it is a very time-consuming task to analyze massive number of PFs on identical or similar network topology. This letter presents a novel GPU-accelerated batch LU-factorization solver that achieves higher level of parallelism and better memory-access efficiency through packaging massive number of LU-factorization tasks to formulate a new larger-scale problem. The proposed solver can achieve up to 76 times speedup when compared to KLU library and lays a critical foundation for massive-PFs-solving applications.
Keyword:
Degree of parallelism
graphics processing unit (GPU)
LU factorization
parallel computing
power flow
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.2
论文数:
1.1W
被引数:
5.0W
查看更多机构
.png){kind=icon}
