High-performance computing for static security assessment of large power systems

IF 3.2 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Connection Science Pub Date : 2023-10-04 DOI:10.1080/09540091.2023.2264537
Venkateswara Rao Kagita, Sanjaya Kumar Panda, Ram Krishan, P. Deepak Reddy, Jabba Aswanth
{"title":"High-performance computing for static security assessment of large power systems","authors":"Venkateswara Rao Kagita, Sanjaya Kumar Panda, Ram Krishan, P. Deepak Reddy, Jabba Aswanth","doi":"10.1080/09540091.2023.2264537","DOIUrl":null,"url":null,"abstract":"Contingency analysis (CA) is one of the essential tools for the optimal design and security assessment of a reliable power system. However, its computational requirements rise with the growth of distributed generations in the interconnected power system. As CA is a complex and computationally intensive problem, it requires a fast and accurate calculation to ensure the secure operation. Therefore, efficient mathematical modelling and parallel programming are key to efficient static security analysis. This paper proposes a parallel algorithm for static CA that uses both central processing units (CPUs) and graphical processing units (GPUs). To enhance the accuracy, AC load flow is used, and parallel computation of load flow is done simultaneously, with efficient screening and ranking of the critical contingencies. We perform extensive experiments to evaluate the efficacy of the proposed algorithm. As a result, we establish that the proposed parallel algorithm with high-performance computing (HPC) computing is much faster than the traditional algorithms. Furthermore, the HPC experiments were conducted using the national supercomputing facility, which demonstrates the proposed algorithm in the context of N−1 and N−2 static CA with immense power systems, such as the Indian northern regional power grid (NRPG) 246-bus and the polish 2383-bus networks.","PeriodicalId":50629,"journal":{"name":"Connection Science","volume":"303 1","pages":"0"},"PeriodicalIF":3.2000,"publicationDate":"2023-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Connection Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/09540091.2023.2264537","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0

Abstract

Contingency analysis (CA) is one of the essential tools for the optimal design and security assessment of a reliable power system. However, its computational requirements rise with the growth of distributed generations in the interconnected power system. As CA is a complex and computationally intensive problem, it requires a fast and accurate calculation to ensure the secure operation. Therefore, efficient mathematical modelling and parallel programming are key to efficient static security analysis. This paper proposes a parallel algorithm for static CA that uses both central processing units (CPUs) and graphical processing units (GPUs). To enhance the accuracy, AC load flow is used, and parallel computation of load flow is done simultaneously, with efficient screening and ranking of the critical contingencies. We perform extensive experiments to evaluate the efficacy of the proposed algorithm. As a result, we establish that the proposed parallel algorithm with high-performance computing (HPC) computing is much faster than the traditional algorithms. Furthermore, the HPC experiments were conducted using the national supercomputing facility, which demonstrates the proposed algorithm in the context of N−1 and N−2 static CA with immense power systems, such as the Indian northern regional power grid (NRPG) 246-bus and the polish 2383-bus networks.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
大型电力系统静态安全评估的高性能计算
应急分析是进行可靠电力系统优化设计和安全评估的重要工具之一。然而,随着互联电力系统中分布式电源的增加,其计算量也随之增加。CA是一个复杂且计算量大的问题,为了保证安全运行,需要快速准确的计算。因此,高效的数学建模和并行编程是高效的静态安全分析的关键。本文提出了一种同时使用中央处理器(cpu)和图形处理器(gpu)的静态CA并行算法。为提高计算精度,采用交流潮流,同时进行潮流并行计算,有效筛选和排序临界事故。我们进行了大量的实验来评估所提出算法的有效性。结果表明,采用高性能计算(HPC)的并行算法比传统算法运行速度快得多。此外,利用国家超级计算设施进行了HPC实验,验证了所提出的算法在大型电力系统(如印度北部地区电网(NRPG) 246总线和波兰2383总线网络)的N−1和N−2静态CA环境下的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Connection Science
Connection Science 工程技术-计算机:理论方法
CiteScore
6.50
自引率
39.60%
发文量
94
审稿时长
3 months
期刊介绍: Connection Science is an interdisciplinary journal dedicated to exploring the convergence of the analytic and synthetic sciences, including neuroscience, computational modelling, artificial intelligence, machine learning, deep learning, Database, Big Data, quantum computing, Blockchain, Zero-Knowledge, Internet of Things, Cybersecurity, and parallel and distributed computing. A strong focus is on the articles arising from connectionist, probabilistic, dynamical, or evolutionary approaches in aspects of Computer Science, applied applications, and systems-level computational subjects that seek to understand models in science and engineering.
期刊最新文献
Devising single in-out long short-term memory univariate models for predicting the electricity price on the day-ahead markets A continual learning framework to train robust image recognition models by adversarial training and knowledge distillation IPFS-blockchain-based delegation model for internet of medical robotics things telesurgery system Toward cost-effective quantum circuit simulation with performance tuning techniques ERAM-EE: Efficient resource allocation and management strategies with energy efficiency under fog–internet of things environments
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1