Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Parallel Contingency Analysis for Power Systems Operation and Planning


Affiliations
1 Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai – 600036, India
     

   Subscribe/Renew Journal


This paper proposes a parallel processing approach to Contingency Analysis (CA) for power system security evaluation. Full AC power fl ow analysis is done for each contingency and violations of bus voltages and line fl ows are evaluated. All possible line outages are considered to avoid overlooking of certain critical cases. Parallel Processing is employed to increase the speed of execution. Parallelism is achieved by sharing each contingency across processors. The proposed methodology is implemented in a Linux Cluster. Data communication is performed through the Message Passing Interface (MPI). The effectiveness of parallelism is demonstrated by performing contingency analysis on standard IEEE Systems. The performance of the algorithm is analyzed in terms of computation speed and effi ciency in comparison with the sequential approach.
User
Subscription Login to verify subscription
Notifications
Font Size

Abstract Views: 195

PDF Views: 0




  • Parallel Contingency Analysis for Power Systems Operation and Planning

Abstract Views: 195  |  PDF Views: 0

Authors

G. A. Ezhilarasi
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai – 600036, India
K. S. Swarup
Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai – 600036, India

Abstract


This paper proposes a parallel processing approach to Contingency Analysis (CA) for power system security evaluation. Full AC power fl ow analysis is done for each contingency and violations of bus voltages and line fl ows are evaluated. All possible line outages are considered to avoid overlooking of certain critical cases. Parallel Processing is employed to increase the speed of execution. Parallelism is achieved by sharing each contingency across processors. The proposed methodology is implemented in a Linux Cluster. Data communication is performed through the Message Passing Interface (MPI). The effectiveness of parallelism is demonstrated by performing contingency analysis on standard IEEE Systems. The performance of the algorithm is analyzed in terms of computation speed and effi ciency in comparison with the sequential approach.


DOI: https://doi.org/10.33686/prj.v7i2.189816