{"title":"A dynamic partitioning scheme for parallel transient stability analysis","authors":"N. Zhu, A. Bose","doi":"10.1109/PICA.1991.160615","DOIUrl":null,"url":null,"abstract":"A dynamic partitioning scheme for a large power system is used to speed up the transient stability solution by utilizing different step sizes for the different portions. The partitioning and the different step sizes naturally lend themselves to a parallel implementation. Results are obtained by utilizing the successive overrelaxation (SOR) Newton parallel algorithm on the Alliant FX/8, an eight-processor parallel computer. For a 662 bus system, a total speedup, by partitioning and parallelizing, of 33.5 is obtained. Since parallelization by itself with 8 processors can produce a speedup of about 7, the partitioning scheme provides a speedup factor of about 5. The partitioning scheme is not specific to either the SOR Newton algorithm or the Alliant machine, and its application to any other parallel method should result in a similar speedup.<<ETX>>","PeriodicalId":287152,"journal":{"name":"[Proceedings] Conference Papers 1991 Power Industry Computer Application Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"20","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings] Conference Papers 1991 Power Industry Computer Application Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PICA.1991.160615","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 20
Abstract
A dynamic partitioning scheme for a large power system is used to speed up the transient stability solution by utilizing different step sizes for the different portions. The partitioning and the different step sizes naturally lend themselves to a parallel implementation. Results are obtained by utilizing the successive overrelaxation (SOR) Newton parallel algorithm on the Alliant FX/8, an eight-processor parallel computer. For a 662 bus system, a total speedup, by partitioning and parallelizing, of 33.5 is obtained. Since parallelization by itself with 8 processors can produce a speedup of about 7, the partitioning scheme provides a speedup factor of about 5. The partitioning scheme is not specific to either the SOR Newton algorithm or the Alliant machine, and its application to any other parallel method should result in a similar speedup.<>