scispace - formally typeset
Journal ArticleDOI

Asynchronous Iterative Methods for Multiprocessors

Gérard M. Baudet
- 01 Apr 1978 - 
- Vol. 25, Iss: 2, pp 226-244
Reads0
Chats0
TLDR
A class of asynchronous iterative methods is presented for solving a system of equations corresponding to a parallel implementation on a multiprocessor system with no synchronization between cooperating processes to show clearly the advantage of purely asynchronous Iterative methods.
Abstract
: A class of asynchronous iterative methods is presented for solving a system of equations. Existing iterative methods are identified in terms of asynchronous iterations, and new schemes are introduced corresponding to a parallel implementation on a multiprocessor system with no synchronization between cooperating processes. A sufficient condition is given to guarantee the convergence of any asynchronous iterations, and results are extended to include iterative methods with memory. Asynchronous iterative methods are then evaluated from a computational point of view, and bounds are derived for the efficiency. The bounds are compared with actual measurements obtained by running various asynchronous iterations on a multiprocessor, and the experimental results show clearly the advantage of purely asynchronous iterative methods. (Author)

read more

Citations
More filters
Book

Templates for the Solution of Linear Systems: Building Blocks for Iterative Methods

TL;DR: In this book, which focuses on the use of iterative methods for solving large sparse systems of linear equations, templates are introduced to meet the needs of both the traditional user and the high-performance specialist.
Journal ArticleDOI

Distributed asynchronous deterministic and stochastic gradient optimization algorithms

TL;DR: A model for asynchronous distributed computation is presented and it is shown that natural asynchronous distributed versions of a large class of deterministic and stochastic gradient-like algorithms retain the desirable convergence properties of their centralized counterparts.
Proceedings ArticleDOI

Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms

TL;DR: A model for asynchronous distributed computation is presented and it is shown that natural asynchronous distributed versions of a large class of deterministic and stochastic gradient-like algorithms retain the desirable convergence properties of their centralized counterparts.
Book

Readings in Distributed Artificial Intelligence

Alan H. Bond, +1 more
TL;DR: This comprehensive collection of articles shows the breadth and depth of DAI research as well as to practical problems in artificial intelligence, distributed computing systems, and human-computer interaction.
Book

The design and analysis of parallel algorithms

TL;DR: Kurskod av teknisk-naturvetenskapliga fakultetsnämnden Kursplan giltig från: 2012, vecka 10 Ansvarig enhet: Inst för datavetenskap SCB-ämnesrubrik: Informatik/Dataoch systemvetenskapskap Huvudområden och successiv fördjupning.
References
More filters
Book

Iterative Solution of Nonlinear Equations in Several Variables

TL;DR: In this article, the authors present a list of basic reference books for convergence of Minimization Methods in linear algebra and linear algebra with a focus on convergence under partial ordering.
Journal ArticleDOI

Periodic chaotic relaxation

TL;DR: In this article, the authors generalize two results of that paper concerning periodic chaotic relaxation in which overrelaxation is allowed, and show that the optimum rate of convergence is 0( h 2 ) where h is the mesh length.
Journal ArticleDOI

Contraction en norme vectorielle: Convergence d'iterations chaotiques pour des equations non linéaires de point fixe à plusieurs variables

TL;DR: A survey of results concerning vectorial norms for fixed point problems in several variables can be found in this paper, where the authors focus mainly on the notion of contraction with respect to a vectorial norm which ensures convergence of chaotic iterations.