By Topic

Speedup and synchronisation overhead analysis of Gauss-Seidel type algorithms on a Sequent balance machine

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 $31
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

2 Author(s)
Huang, G. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Ongsakul, W.

The parallelisation and implementation of Gauss-Seidel (G-S) algorithms for power flow analysis have been investigated previously. Numerous runs to demonstrate the speedup have been illustrated on a Sequent Balance shared-memory multi-instruction, multidata access (SM MIMD) machine. The authors extend the idea and investigate-the effects of acceleration factors. It is shown on systems ranging from teens to thousands that when the acceleration factors are used, the implementation using colour-by-colour synchronisation is more reliable and has better convergence rate, even though it takes a longer time to synchronise. The authors also analyse the dependence of synchronisation overhead in terms of system sizes, network connection and number of processors. Comparisons between G-S and fast decoupled load-flow algorithms are also made. The implications on nCUBE implementations are also discussed. It is also shown that the idea of parallel G-S algorithm can be easily extended to solve the transient stability problem which involves a set of algebraic differential equations

Published in:

Generation, Transmission and Distribution, IEE Proceedings-  (Volume:141 ,  Issue: 5 )