1. Home
  2. Fundamental sciences
  3. Mathematics

  4. Parallel Asynchronous Algorithms II. Implementation

Article | REF: AF1386 V1

Parallel Asynchronous Algorithms II. Implementation

Authors: Pierre SPITERI, Jean-Claude MIELLOU

Publication date: October 10, 2021 | Lire en français

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

Automatically translated using artificial intelligence technology (Note that only the original version is binding) > find out more.

    A  |  A

    Overview

    ABSTRACT

    This article is devoted to the implementation of asynchronous parallel iterative algorithms. We will first discuss the implementation of stopping tests both from a computational approach and from a numerical analysis approach using in the latter case either the contraction property or the partial ordering convergence one and also the nested sets. After recalling some notions concerning the architecture of multiprocessor machines, the implementation principle of these asynchronous parallel iterative methods will be discussed, in particular for the sub-domain methods ; load balancing for these algorithms will be also discussed.

    Read this article from a comprehensive knowledge base, updated and supplemented with articles reviewed by scientific committees.

    Read the article

    AUTHORS

    • Pierre SPITERI: Professor Emeritus - University of Toulouse, INP-ENSEEIHT – IRIT, Toulouse, France

    • Jean-Claude MIELLOU: Honorary Professor - University of Bourgogne Franche-Comté, Department of Mathematics, Besançon, France

     INTRODUCTION

    In a first article [AF 1 385] we considered the solution of two types of pseudo-linear problem. The first is a univocal problem of the type

    AU*+Φ(U*)=G( 1 )

    where A is a matrix of dimension M∈ℕ , set of natural numbers, G and U are vectors of dimension M and

    U→Φ(U) est une application continue croissante( 2 )

    The second type of problem is multi-voiced because its solution U is subject to inequality constraints of the type

    Umin≤U* ou bien Umin≤U*≤Umax ou bien U*≤Umax( 3 )

    in this case we need to solve the following multi-voice problem

    AU*+∂Ψ(U
    You do not have access to this resource.

    Exclusive to subscribers. 97% yet to be discovered!

    You do not have access to this resource.
    Click here to request your free trial access!

    Already subscribed? Log in!

    The Ultimate Scientific and Technical Reference

    A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors
    + More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year
    From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

    KEYWORDS

    multiprocessor architecture   |   message passing interface   |   termination of algorithms   |   sub-domain methods

    This article is included in

    Mathematics

    This offer includes:

    Knowledge Base

    Updated and enriched with articles validated by our scientific committees

    Services

    A set of exclusive tools to complement the resources

    Practical Path

    Operational and didactic, to guarantee the acquisition of transversal skills

    Doc & Quiz

    Interactive articles with quizzes, for constructive reading

    Subscribe now!

    Ongoing reading
    Asynchronous parallel algorithms II
    Outline