Skip to main content

An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5336))

Abstract

In this paper we present a practical, efficient and robust algorithm for detecting the global convergence in any asynchronous iterative process. A proven theoretical version, together with a first practical version, was presented in [1]. However, the main drawback of that first practical version was to require the determination of the maximal communication time between any couple of nodes in the system during the entire iterative process. The version presented in this paper does not require any additional information on the parallel system while always ensuring correct detections.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bahi, J., Contassot-Vivier, S., Couturier, R., Vernier, F.: A decentralized convergence detection algorithm for asynchronous parallel iterative algorithms. IEEE Transactions on Parallel and Distributed Systems 16, 4–13 (2005)

    Article  Google Scholar 

  2. Saad, Y.: Iterative methods for sparse linear systems, 2nd edn. SIAM, Philadelphia (2003)

    Book  MATH  Google Scholar 

  3. Bahi, J.M., Contassot-Vivier, S., Couturier, R.: Parallel Iterative Algorithms: from sequential to grid computing. Numerical Analysis & Scientific Computing Series. Chapman & Hall/CRC, Boca Raton (2007)

    MATH  Google Scholar 

  4. Maillard, N., Daoudi, E.M., Manneback, P., Roch, J.L.: Contrôle amorti des synchronisations pour le test d’arrêt des méthodes itératives. In: Renpar 14, Hamamet, Tunisie, pp. 177–182 (2002)

    Google Scholar 

  5. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Engelwood Cliffs (1989)

    MATH  Google Scholar 

  6. Savari, S.A., Bertsekas, D.P.: Finite termination of asynchronous iterative algorithms. Parallel Computing 22, 39–56 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  7. Charão, A.S.: Multiprogrammation parallèle générique des méthodes de décomposition de domaine. PhD thesis, INPG (2001)

    Google Scholar 

  8. Bahi, J., Contassot-Vivier, S., Couturier, R.: Dynamic load balancing and efficient load estimators for asynchronous iterative algorithms. IEEE Transactions on Parallel and Distributed Systems 16, 289–299 (2005)

    Article  Google Scholar 

  9. Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs (1989)

    MATH  Google Scholar 

  10. Tarazi, M.E.: Some convergence results for asynchronous algorithms. Numer. Math. 39, 325–340 (1982)

    Article  MathSciNet  MATH  Google Scholar 

  11. The NAS parallel benchmark (1996), science.nas.nasa.gov/Software/NPB/

  12. Bahi, J., Domas, S., Mazouzi, K.: Jace: a java environment for distributed asynchronous iterative computations. In: 12th Euromicro Conference on Parallel, Distributed and Network based Processing, PDP 2004, Coruna, Spain, pp. 350–357. IEEE Computer Society Press, Los Alamitos (2004)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2008 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bahi, J.M., Contassot-Vivier, S., Couturier, R. (2008). An Efficient and Robust Decentralized Algorithm for Detecting the Global Convergence in Asynchronous Iterative Algorithms. In: Palma, J.M.L.M., Amestoy, P.R., Daydé, M., Mattoso, M., Lopes, J.C. (eds) High Performance Computing for Computational Science - VECPAR 2008. VECPAR 2008. Lecture Notes in Computer Science, vol 5336. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-92859-1_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-92859-1_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-92858-4

  • Online ISBN: 978-3-540-92859-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics