Abstract
This paper presents an algorithm for the parallel solution of the security constrained optimal-power flow (SCOPF) problem using an asynchronous programming model. In addition to the increased efficiency, the proposed model allows for the development of applications that can be ported among different parallel computer architectures in a nearly transparent way and without significant loss of computing efficiency. The initial implementation of the approach was made on a 9-processor shared-memory parallel computer; subsequently, the system has been ported to a 64-processor distributed-memory parallel machine. The paper summarizes the results obtained in tests performed with two real-life systems: a network formed by 735 buses, 1212 branches and 76 adjustable power generators (900 contingencies); and a network with 1663 buses, 2349 branches and 99 adjustable generators (1555 contingencies).< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
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.
