Abstract
This paper presents a parallel Newton-GMRES (generalised minimal residual) power flow solution algorithm based on a message-passing distributed-memory multiprocessor architecture such as a cluster of workstations. The results show that the new algorithm can achieve good performance for two large-scale power system cases on a small cluster of GNU/Linux single-processor workstations. The workstations are connected via 1.0 Gbit/s Ethernet. The comparison between iterative methods and direct methods for the parallel solution of large sparse linear systems is also presented. It is shown that the parallel GMRES method is more scalable than the parallel direct method in a low latency network. Based on the presented parallel iterative linear solver, it is possible to exploit any parallelism in the Newton power flow solution process. For a workstation cluster on 1.0 Gbit/s Ethernet, which has high latency, the speedup appears to saturate. Nevertheless, when a low latency network, such as Myrinet, is available, the power flow algorithm with an iterative linear solver is expected to be more scalable than that with a direct linear solver.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
