By Topic

Asynchronous programming model for the concurrent solution of the security constrained optimal power flow problem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Rodrigues, M. ; DSEE-FEE-Unicamp, Campinas, Brazil ; Saavedra, O.R. ; Monticelli, A.

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)

Published in:

Power Systems, IEEE Transactions on  (Volume:9 ,  Issue: 4 )