Cart (Loading....) | Create Account
Close category search window
 

Managing the bottlenecks in parallel Gauss-Seidel type algorithms for power flow analysis

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 $13
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.

In previous papers, the parallelization and implementations of Gauss-Seidel (G-S) algorithms for power flow analysis have been investigated on a Sequent Balance shared memory (SM) machine. In this paper, the authors generalize the idea to more general computer architectures and demonstrate how to effectively increase the speed-up upper bounds of G-S algorithms by properly managing the bottlenecks on both Sequent Balance SM and nCUBE2 distributed memory (DM) machines. For G-S algorithms, when the coloring process is used to schedule the processors, there is almost no sequential portion. Thus, the only decisive factor left, which has a direct impact on the speed-up upper bound, is the synchronization overhead. Accordingly, the authors propose a new synchronization scheme which can reduce the synchronization overhead on the Sequent Balance machine. Also, on the nCUBE2 machine, a new clustered G-S algorithm is proposed and implemented. The algorithm carefully schedules their processors, computational loads and communication overheads for the best performance. In addition, the synchronization overheads and speed-up upper bounds on both machines are analyzed in terms of power system size and number of processors. The competitiveness of G-S type algorithms is also discussed

Published in:

Power Systems, IEEE Transactions on  (Volume:9 ,  Issue: 2 )

Date of Publication:

May 1994

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.