A message-passing distributed-memory parallel power flow algorithm

This paper presents a parallel direct linear solver based on a message-passing distributed-memory multiprocessor architecture such as a cluster of workstations. The results show that the new algorithm can achieve nearly linear speedup for two large-scale power system cases on a small cluster of GNU/Linux dual-processor workstations. The workstations are connected via 100 Mbit/s Ethernet, i.e., the parallel machine consists of hardware readily found in any engineering department. Based on the presented parallel direct linear solver, it is possible to parallelize totally the Newton power flow solution process. In addition, the METIS-based partitioning scheme can handle common control devices such as PV-PQ switching. Furthermore, by tuning the vertex and branch weights, the performance of the power flow solution can be optimized for the available hardware. For a workstation cluster on 100 Mbit/s Ethernet, the speedup appears to saturate beyond eight processors due to load imbalance and the aggregate growth of the partition separators. Nevertheless, the message-passing distributed-memory multiprocessor architecture can be used in other power system applications, such as state estimation and transient stability. Furthermore, an iterative linear solver could improve scalability.

[1]  Tao Yang,et al.  Elimination forest guided 2D sparse LU factorization , 1998, SPAA '98.

[2]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[3]  Geoffrey C. Fox,et al.  A parallel Gauss-Seidel algorithm for sparse power system matrices , 1994, Proceedings of Supercomputing '94.

[4]  James Demmel,et al.  A Scalable Sparse Direct Solver Using Static Pivoting , 1999, PPSC.

[5]  Xiaoye S. Li,et al.  SuperLU Users'' Guide , 1997 .

[6]  Vipin Kumar,et al.  Highly Scalable Parallel Algorithms for Sparse Matrix Factorization , 1997, IEEE Trans. Parallel Distributed Syst..

[7]  William Gropp,et al.  User's Guide for mpich, a Portable Implementation of MPI Version 1.2.2 , 1996 .

[8]  Anjan Bose,et al.  Bottlenecks in parallel algorithms for power system stability analysis , 1993 .

[9]  Geoffrey C. Fox,et al.  Parallel block-diagonal-bordered sparse linear solvers for electrical power system applications , 1993, Proceedings of Scalable Parallel Libraries Conference.

[10]  James Demmel,et al.  An Asynchronous Parallel Supernodal Algorithm for Sparse Gaussian Elimination , 1997, SIAM J. Matrix Anal. Appl..

[11]  Michael T. Heath,et al.  A distributed solution of sparse linear systems , 2001 .

[12]  Weerakorn Ongsakul,et al.  Managing the bottlenecks in parallel Gauss-Seidel type algorithms for power flow analysis , 1993 .

[13]  I. C. Decker,et al.  Conjugate gradient methods for power system dynamic simulation on parallel computers , 1996 .

[14]  Daniel Tylavsky,et al.  Parallel processing in power systems computation , 1992 .

[15]  B.F. Wollenberg,et al.  Power System Steady State Security Analysis Using Vector Processing Computes , 1992, IEEE Power Engineering Review.

[16]  Anjan Bose,et al.  Parallel solution of large sparse matrix equations and parallel power flow , 1995 .

[17]  Tao Yang,et al.  Efficient Sparse LU Factorization with Partial Pivoting on Distributed Memory Architectures , 1998, IEEE Trans. Parallel Distributed Syst..

[18]  Mario Montagna,et al.  Levelwise algorithms for vector processing of sparse power system matrices , 1995 .

[19]  Vipin Kumar,et al.  PSPASES: An Efficient and Scalable Parallel Sparse Direct Solver , 1999, PPSC.

[20]  Carlos R. Minussi,et al.  Fast-forward/fast-backward substitutions on vector computers , 1999 .

[21]  Peter W. Sauer,et al.  Iterative solver techniques in fast dynamic calculations of power systems , 2001 .

[22]  J. E. Van Ness,et al.  Parallel solution of sparse algebraic equations , 1993 .