The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (1996 vol.7)
pp: 677-688
ABSTRACT
<p><b>Abstract</b>—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 <it>Team Algorithms</it>, 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.</p>
INDEX TERMS
Distributed memory multicomputer, asynchronous methods, nonlinear equations, block-iterative methods, convergence conditions, team algorithms, load flow problem, electrical power networks.
CITATION
Eugenius Kaszkurewicz, Amit Bhaya, "Parallel Asynchronous Team Algorithms: Convergence and Performance Analysis", IEEE Transactions on Parallel & Distributed Systems, vol.7, no. 7, pp. 677-688, July 1996, doi:10.1109/71.508248
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool