Convergence rate and termination of asynchronous iterative algorithms

We consider iterative algorithms of the form z := f(z), executed by a parallel or distributed computing system. We focus on asynchronous implementations whereby each processor iterates on a different component of z, at its own pace, using the most recently received (but possibly outdated) information on the remaining components of 2. We provide results on the convergence rate of such algorithms and make a comparison with the convergence rate of the corresponding synchronous methods in which the computation proceeds in phases. We also present results on how to terminate asynchronous iterations in finite time with an approximate solution of the computational problem under consideration.

• Type: Conference
• Year: 1989
• Where: ICS
• Authors: Dimitri P. Bertsekas, John N. Tsitsiklis
• Keywords: Asynchronous Implementations, Convergence Rate, Distributed And Parallel Computing, ICS 1989, Iterative Algorithms