In recent years, parallel processing has been applied for time domain simulations of power system transient behavior in order to implement real-time Dynamic Security Assessment. In this paper, two different algorithms have been implemented and compared: the Shifted-Picard (SP) and the Very DisHonest Newton (VDHN). The former has been proved to be effective when parallelism-in-time is adopted whereas the latter is an effective solver when parallelism-in-space is exploited. Furthermore, two different parallel computing architectures have been considered: namely, the Sequent Symmetry computer with 26 processors which is a data shared memory machine and the nCUBE characterized by 128 CPUs which is a typical message passing parallel machine. A realistic network with 662 buses has been used to assess the performance of the different implementations. The comparison of the results allows the reader to understand both the limitations of the algorithmic approaches and the constraints imposed by the two parallel architectures. An optimal grain of the parallelism associated to the problem can be identified through the reported experience.

Comparison of algorithms for transient stability simulations on shared and distributed memory multiprocessors

M. La Scala;
1996

Abstract

In recent years, parallel processing has been applied for time domain simulations of power system transient behavior in order to implement real-time Dynamic Security Assessment. In this paper, two different algorithms have been implemented and compared: the Shifted-Picard (SP) and the Very DisHonest Newton (VDHN). The former has been proved to be effective when parallelism-in-time is adopted whereas the latter is an effective solver when parallelism-in-space is exploited. Furthermore, two different parallel computing architectures have been considered: namely, the Sequent Symmetry computer with 26 processors which is a data shared memory machine and the nCUBE characterized by 128 CPUs which is a typical message passing parallel machine. A realistic network with 662 buses has been used to assess the performance of the different implementations. The comparison of the results allows the reader to understand both the limitations of the algorithmic approaches and the constraints imposed by the two parallel architectures. An optimal grain of the parallelism associated to the problem can be identified through the reported experience.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: http://hdl.handle.net/11589/11723
 Attenzione

Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo

Citazioni
  • Scopus 33
  • ???jsp.display-item.citation.isi??? 25
social impact