Parallel Asynchronous Team Algorithms: Convergence and Performance Analysis

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.

DOI: 10.1109/71.508248

Extracted Key Phrases

Cite this paper

@article{Barn1996ParallelAT, title={Parallel Asynchronous Team Algorithms: Convergence and Performance Analysis}, author={Benjam{\'i}n Bar{\'a}n and Eugenius Kaszkurewicz and Amit Bhaya}, journal={IEEE Trans. Parallel Distrib. Syst.}, year={1996}, volume={7}, pages={677-688} }