This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Parallel Asynchronous Team Algorithms: Convergence and Performance Analysis
July 1996 (vol. 7 no. 7)
pp. 677-688

Abstract—This paper formalizes a general technique to combine different methods in the solution of large systems of nonlinear equations using parallel asynchronous implementations on distributed-memory multiprocessor systems. Such combinations of methods, referred to as Team Algorithms, are evaluated as a way of obtaining desirable properties of different methods and a sufficient condition for their convergence is derived. The load flow problem of electrical power networks is presented as an example problem that, under certain conditions, has the characteristics to make a Team Algorithm an appealing choice for its solution. Experimental results of an implementation on an Intel iPSC/860 Hypercube are reported, showing that considerable speedup and robustness can be obtained using team algorithms.

[1] D.P. Bertsekas and J.N. Tsitsiklis, Parallel and Distributed Computation.Englewood Cliffs, N.J.: Prentice Hall International, 1989.
[2] E. Kaszkurewicz, A. Bhaya, and D.D. Siljak, "On the Convergence of Parallel Asynchronous Block-Iterative Computations," Linear Algebra Applications, vol. 131, pp. 139-160, 1990.
[3] Y.P. Dusonchet, S.N. Talukdar, and H.E. Sinnot, "Load Flows Using a Combination of Point Jacobi and Newton's Methods," IEEE Trans. Power Apparatus and Systems, vol. 90, pp. 941-949, 1971.
[4] S.N. Talukdar, S.S. Pyo, and R. Mehrotra, "Designing Algorithms and Assignments for Distributed Processing," Technical Report EL-3317, Electric Power Research Inst., 1983.
[5] A. Bhaya, E. Kaskurewicz, and F.C. Mota, "Asynchronous Block-Iterative Methods for Almost-Linear Equations," Linear Algebra Applications, vols. 154-156, pp. 487-508, 1991.
[6] H.P. Nii, "Blackboard Systems, Part One: The Blackboard Model of Problem Solving and the Evolution of Blackboard Architectures," AI Magazine, vol. 7, 1986, pp. 38-53.
[7] P. Souza and S. Talukdat, "Genetic Algorithms in Asynchronous Teams," Proc.Fourth Int'l Conf. Genetic Algorithms, pp. 392-397,California, 1991.
[8] S.N. Talukdar, V.C. Ramesh, and J.C. Nixon, "A Distributed System of Control Specialists for Real-Time Operations," Proc. Third Symp. Expert System Applications to Power Systems,Japan, 1991.
[9] S.N. Talukdar, V.C. Ramesh, R. Quadrel, and R. Christie, "Multiagent Organizations for Real-Time Operations," Proc. IEEE, vol. 80, pp. 765-778, 1992.
[10] M. Ikeda and D. Siljak, "Overlapping Decomposition, Expansions and Contractions of Dynamic Systems," Large Scale Systems, vol. 1, pp. 29-38, 1980.
[11] B. Barán, "A Study of Parallel Asynchronous Team Algorithms," PhD thesis, Federal Univ. of Rio de Janeiro, COPPE, EE Dept., 1993.(in Portuguese)
[12] A. Vanelli, "Solution Techniques for 0-1 Indefinite Quadratic Programming Problems with Applications to Decomposition," PhD thesis, Univ. of Waterloo, 1983.
[13] J. Calvet and A. Titli, "Overlapping vs. Partitioning in Block-Iteration Methods: Application in Large-Scale System," Automatic, vol. 25, no. 1, pp. 137-145, 1989.
[14] M. Sezer and D. Siljak, "Nested Epsilon Decompositions of Linear Systems: Weakly Coupled and Overlapped Blocks," SIAM J. Matrix Analysis and Applications, vol. 12, pp. 521-533, 1991.
[15] M.H.M. Vale, D.M. Falcão, and E. Kaszkurewicz, "Electrical Power Network Decomposition for Parallel Computations," 1992 IEEE ISCAS, vol. 6, pp. 2,761-2,764,San Diego, Calif., May 1992.
[16] B. Stott, "Review of Load-Flow Calculation Methods," Proc. IEEE, vol. 62, no. 7, pp. 916-927, 1974.
[17] B. Stott and O. Alsaç, "Fast Decoupled Load Flow," IEEE Trans. Power Apparatus and Systems, vol. 93, pp. 859-869, 1974.
[18] F.F. Wu, "Theoretical Study of the Convergence of the Fast Decoupled Load-flow," IEEE Trans. Power Apparatus and Systems, vol. 96, pp. 268-275, 1977.
[19] A. Sangiovanni-Vincentelli, L.K. Chen, and L.O. Chua, "An Efficient Heuristic Cluster Algorithm for Tearing Large-Scale Networks," IEEE Trans. Circuits and Systems, vol. 24, pp. 709-717, Dec. 1977.
[20] J. Undrill and H. Happ, "Automatic Sectionalization of Power System Networks for Network Solutions," IEEE Trans. Power Apparatus and Systems, vol. 90, no. 1, pp. 46-53, 1971.
[21] A.O.M. Saleh and M.A. Laughton, "Cluster Analysis of Power System Networks for Array Processing Solutions," IEE Proc.—Part C, vol. 132, pp. 172-178, July 1985.
[22] H.S. Stone, High Performance Computer Architectures.Reading, Mass.: Addison-Wesley, 1987.

Index Terms:
Distributed memory multicomputer, asynchronous methods, nonlinear equations, block-iterative methods, convergence conditions, team algorithms, load flow problem, electrical power networks.
Citation:
Benjamín Barán, Eugenius Kaszkurewicz, Amit Bhaya, "Parallel Asynchronous Team Algorithms: Convergence and Performance Analysis," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 7, pp. 677-688, July 1996, doi:10.1109/71.508248
Usage of this product signifies your acceptance of the Terms of Use.