Hadoop平台上最优潮流的并行算法

Bingjie Liang, Song Jin, Wei Tang, W. Sheng, Ke-yan Liu
{"title":"Hadoop平台上最优潮流的并行算法","authors":"Bingjie Liang, Song Jin, Wei Tang, W. Sheng, Ke-yan Liu","doi":"10.1109/APPEEC.2016.7779568","DOIUrl":null,"url":null,"abstract":"Application of smart grid leads to significant increase in scale and data of the power systems, bringing new challenges to the calculation of optimal power flow. However, the existing parallel algorithms, such as MPI-based solutions, suffer from high computational complexity. In this paper, we propose a parallel algorithm of optimal power flow based on Map-Reduce framework. More concretely, the node reordering in our algorithm can greatly accelerate solution speed of the linear equations meanwhile fit well with Map-Reduce programming specifications. Moreover, we determine the appropriate formats for input, intermediate and output data sets and partition the algorithm into separate map/reduce tasks. This facilitates our algorithm to be executed in parallel on a large number of computing nodes. The proposed algorithm is verified on a Hadoop cluster. The experimental results demonstrate that the effectiveness of the propose algorithm.","PeriodicalId":117485,"journal":{"name":"2016 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A parallel algorithm of optimal power flow on Hadoop platform\",\"authors\":\"Bingjie Liang, Song Jin, Wei Tang, W. Sheng, Ke-yan Liu\",\"doi\":\"10.1109/APPEEC.2016.7779568\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Application of smart grid leads to significant increase in scale and data of the power systems, bringing new challenges to the calculation of optimal power flow. However, the existing parallel algorithms, such as MPI-based solutions, suffer from high computational complexity. In this paper, we propose a parallel algorithm of optimal power flow based on Map-Reduce framework. More concretely, the node reordering in our algorithm can greatly accelerate solution speed of the linear equations meanwhile fit well with Map-Reduce programming specifications. Moreover, we determine the appropriate formats for input, intermediate and output data sets and partition the algorithm into separate map/reduce tasks. This facilitates our algorithm to be executed in parallel on a large number of computing nodes. The proposed algorithm is verified on a Hadoop cluster. The experimental results demonstrate that the effectiveness of the propose algorithm.\",\"PeriodicalId\":117485,\"journal\":{\"name\":\"2016 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/APPEEC.2016.7779568\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/APPEEC.2016.7779568","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

智能电网的应用导致电力系统规模和数据量的显著增加,给最优潮流的计算带来了新的挑战。然而,现有的并行算法,如基于mpi的解决方案,具有较高的计算复杂度。本文提出了一种基于Map-Reduce框架的并行最优潮流算法。更具体地说,我们的算法中的节点重排序可以大大加快线性方程的求解速度,同时很好地符合Map-Reduce编程规范。此外,我们确定了输入、中间和输出数据集的适当格式,并将算法划分为单独的map/reduce任务。这有助于我们的算法在大量计算节点上并行执行。在Hadoop集群上对该算法进行了验证。实验结果证明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A parallel algorithm of optimal power flow on Hadoop platform
Application of smart grid leads to significant increase in scale and data of the power systems, bringing new challenges to the calculation of optimal power flow. However, the existing parallel algorithms, such as MPI-based solutions, suffer from high computational complexity. In this paper, we propose a parallel algorithm of optimal power flow based on Map-Reduce framework. More concretely, the node reordering in our algorithm can greatly accelerate solution speed of the linear equations meanwhile fit well with Map-Reduce programming specifications. Moreover, we determine the appropriate formats for input, intermediate and output data sets and partition the algorithm into separate map/reduce tasks. This facilitates our algorithm to be executed in parallel on a large number of computing nodes. The proposed algorithm is verified on a Hadoop cluster. The experimental results demonstrate that the effectiveness of the propose algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Electric Vehicle charging management algorithm for a UK low-voltage residential distribution network An optimization model of EVs charging and discharging for power system demand leveling A circuit approach for the propagation analysis of voltage unbalance emission in power systems A novel high-power AC/AC modular multilevel converter in Y configuration and its control strategy Comprehensive optimization for power system with multiple HVDC infeed
×
引用
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