On-line Dynamic Security Assessment (DSA) is a challenge computing problem. A key problem in DSA is the analysis of a large number of dynamic stability contingencies every 10-20 minutes using on-line data. In order to speed up the transient stability analysis, parallel processing has been applied and several results can be found in the literature. In this paper, we present a distributed approach for real-time transient stability analysis. Distributed computing is economically attractive providing the processing power of supercomputing at a lower cost. Several distributed software environments like the Parallel Virtual Machine (PVM) allow an effective use of heterogeneous clusters of workstations. Both functional and domain decomposition of the transient stability problem were tested under PVM on a homogeneous cluster of eight DEC ALPHA and on an IBM SP2 machine. Functional decomposition has been obtained by the Shifted-Picard algorithm, whereas domain decomposition has been obtained concurrently running different contingencies on different nodes of the cluster, using the Very Dishonest Newton algorithm. In order to assess the performance of these approaches, time domain simulations, adopting detailed modeling for synchronous machines, have been carried out on a realistic-sized network comprising 2583 buses and 511 generators. © 1996 IEEE.
A distributed computing approach for real-time transient stability analysis
Bochicchio Mario Alessandro;
1997-01-01
Abstract
On-line Dynamic Security Assessment (DSA) is a challenge computing problem. A key problem in DSA is the analysis of a large number of dynamic stability contingencies every 10-20 minutes using on-line data. In order to speed up the transient stability analysis, parallel processing has been applied and several results can be found in the literature. In this paper, we present a distributed approach for real-time transient stability analysis. Distributed computing is economically attractive providing the processing power of supercomputing at a lower cost. Several distributed software environments like the Parallel Virtual Machine (PVM) allow an effective use of heterogeneous clusters of workstations. Both functional and domain decomposition of the transient stability problem were tested under PVM on a homogeneous cluster of eight DEC ALPHA and on an IBM SP2 machine. Functional decomposition has been obtained by the Shifted-Picard algorithm, whereas domain decomposition has been obtained concurrently running different contingencies on different nodes of the cluster, using the Very Dishonest Newton algorithm. In order to assess the performance of these approaches, time domain simulations, adopting detailed modeling for synchronous machines, have been carried out on a realistic-sized network comprising 2583 buses and 511 generators. © 1996 IEEE.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
