Parallel asynchronous algorithms: A survey

•Parallel asynchronous iterative methods and their extensions are presented and analyzed.•Behavior of algorithms is analyzed by contraction property, partial ordering property and nestedsets.•Stopping tests of iterations are presented derived both from computer science and from numerical analysis ap...

Full description

Saved in:

Bibliographic Details
Published in:	Advances in engineering software (1992) Vol. 149; p. 102896
Main Author:	Spiteri, Pierre
Format:	Journal Article
Language:	English
Published:	Elsevier Ltd 01.11.2020 Elsevier
Subjects:	Application of parallel asynchronous algorithm Discretized pseudo-linear problem Efficiency of parallel asynchronous algorithm Engineering Sciences High performance computing Implementation of parallel asynchronous algorithm Iterative method Large scale systems Multisplitting method Nonlinear boundary value problems Optimization Parallel asynchronous algorithm Subdomain method Substructuring method Termination of parallel iterative asynchronous algorithms Termination of parallel iterative asynchronous algorithms Iterative method Application of parallel asynchronous algorithm Efficiency of parallel asynchronous algorithm Large scale systems Discretized pseudo-linear problem Optimization Substructuring method Parallel asynchronous algorithm Multisplitting method High performance computing Nonlinear boundary value problems Subdomain method Implementation of parallel asynchronous algorithm
ISSN:	0965-9978
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	•Parallel asynchronous iterative methods and their extensions are presented and analyzed.•Behavior of algorithms is analyzed by contraction property, partial ordering property and nestedsets.•Stopping tests of iterations are presented derived both from computer science and from numerical analysis approach.•Principle of implementation of these methods is described for subdomain methods with and without overlapping.•Various applications related to pseudo - linear systems eventually constrained of such algorithms are presented. This paper deals with a synthetic presentation of parallel iterative asynchronous algorithms and their extensions for the solution of large sparse linear or pseudo-linear algebraic systems eventually constrained. The behavior of these iterative parallel asynchronous algorithms is studied by three distinct methods : contraction property, partial ordering property linked to the discrete maximum principle and nested sets; the link between these three kinds of analysis is presented. Stopping tests of the iterations are presented both from computer science and from numerical analysis approach including in this last case approximate contraction property, partial ordering property linked to the discrete maximum principle and nested sets. The principle of implementation of these parallel asynchronous iterative methods is described for subdomain method without overlapping and for subdomain method with overlapping; the use of load balancing approach for asynchronous parallel algorithms is also discussed. Various applications modelled by linear equations or pseudo linear equations and solved by such parallel algorithms are presented as well as the uses of these methods in computer security and Boolean calculation. The efficiency of parallel iterative asynchronous algorithms is also discussed.
ISSN:	0965-9978
DOI:	10.1016/j.advengsoft.2020.102896