A GPU-Accelerated Distributed Algorithm for Optimal Power Flow in Distribution Systems
Minseok Ryua, Geunyeong Byeona, Kibaek Kimb
- aSchool of Computing and Augmented Intelligence, Arizona State University,Tempe,AZ,USA
- bMathematics and Computer Science Division, Argonne National Laboratory,Lemont,IL,USA
Papers open inside SciRah from the original publisher or repository; SciRah never hosts them.
Abstract
We propose a GPU-accelerated distributed optimization algorithm for controlling multi-phase optimal power flow in active distribution systems with dynamically changing topologies. To handle varying network configurations and enable adaptable decomposition, we advocate a componentwise decomposition strategy. However, this approach can lead to a prolonged computation time mainly due to the excessive iterations required for achieving consensus among a large number of fine-grained components. To overcome this, we introduce a technique that segregates equality constraints from inequality constraints, enabling GPU parallelism to reduce per-iteration time by orders of magnitude, thereby significantly accelerating the overall computation. Numerical experiments on IEEE test systems ranging from 13 to 8500 buses demonstrate the superior scalability of the proposed approach compared to its CPU-based counterparts.
TL;DRA technique is introduced that segregates equality constraints from inequality constraints, enabling GPU parallelism to reduce per-iteration time by orders of magnitude, thereby significantly accelerating the overall computation. (Semantic Scholar)