Please use this identifier to cite or link to this item:
|Type:||Artigo de periódico|
|Title:||Asynchronous Programming Model For The Concurrent Solution Of The Security Constrained Optimal Power Flow Problem|
|Abstract:||This paper presents an algorithm for the parallel solution of the security constrained optimal power flow (SCOPF) problem using a 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: the Southern network formed by 725 buses, 1212 branches and 76 adjustable power generators (900 contingencies); and the Southeastern network with 1663 buses, 2349 branches and 99 adjustable generators (1555 contingencies).|
|Editor:||IEEE, Piscataway, NJ, United States|
|Citation:||Ieee Transactions On Power Systems. Ieee, Piscataway, Nj, United States, v. 9, n. 4, p. 2021 - 2027, 1994.|
|Appears in Collections:||Unicamp - Artigos e Outros Documentos|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.