[go: up one dir, main page]
Skip to main content
SpringerLink
Log in

Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

AIAC algorithms (Asynchronous Iterations Asynchronous Communications) are a particular class of parallel iterative algorithms. Their asynchronous nature makes them more efficient than their synchronous counterparts in numerous cases as has already been shown in previous works. The first goal of this article is to compare several parallel programming environments in order to see if there is one of them which is best suited to efficiently implement AIAC algorithms. The main criterion for this comparison consists in the performances achieved in a global context of grid computing for two classical scientific problems. Nevertheless, we also take into account two secondary criteria which are the ease of programming and the ease of deployment. The second goal of this study is to extract from this comparison the important features that a parallel programming environment must have in order to be suited for the implementation of AIAC algorithms.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. O. Aumage, G. Mercier, and R. Namyst. MPICH/Madeleine: a True Multi-Protocol MPI for High-Performance Networks. In Proc. 15th International Parallel and Distributed Processing Symposium (IPDPS 2001), page 51, San Francisco, Apr. 2001. IEEE.

  2. J. Bahi, S. Domas, and K. Mazouzi. Jace : A java environment for distributed asynchronous iterative computations. In 12-th Euromicro Conference on Parallel, Distributed and Network based Processing, PDP'04, pages 350–357, Coruna, Spain, February 2004. IEEE computer society press.

  3. J. M. Bahi. Asynchronous iterative algorithms for nonexpansive linear systems. Journal of Parallel and Distributed Computing, 60(1):92–112, 2000.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. M. Bahi, S. Contassot-Vivier, and R. Couturier. Evaluation of the asynchronous model in iterative algorithms for global computing, 31(5):439–461, 2005.

  5. J. M. Bahi, S. Contassot-Vivier, and R. Couturier. Asynchronism for iterative algorithms in a global computing environment. In The 16th Annual International Symposium on High Performance Computing Systems and Applications (HPCS'2002), pp. 90–97, Moncton, Canada, June 2002.

  6. J. M. Bahi, S. Contassot-Vivier, and R. Couturier. Coupling dynamic load balancing with asynchronism in iterative algorithms on the computational grid. In International Parallel and Distributed Processing Symposium (IPDPS'2003), Nice, France, April 2003. Proceedings on CD-Rom.

  7. J. M. Bahi, J.-C. Miellou, and K. Rhofir. Asynchronous multisplitting methods for nonlinear fixed point problems. Numerical Algorithms, 15(3/4):315–345, 1997.

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  9. A. Frommer and D. Szyld. On asynchronous iterations. J. Comp. Appl. Math., 123:201–216, 2000.

    Article  MathSciNet  Google Scholar 

  10. A. Frommer and D. B. Szyld. Asynchronous iterations with flexible communication for linear systems. Calculateurs Parallèles, Réseaux et Systèmes répartis, 10:421–429, 1998.

    Google Scholar 

  11. W. Gropp, E. Lusk, and A. Skjellum. Using MPI : portable parallel programming with the message passing interface. MIT Press, 1994.

  12. A. Herz and C. Marcus. Distributed dynamics in neural networks. Physical Review E, 47(3):2155–2161, 1993.

    Article  Google Scholar 

  13. R. Namyst and J.-F. Méhaut. PM2: Parallel multithreaded machine. A computing environment for distributed architectures. In Parallel Computing: State-of-the-Art and Perspectives, ParCo'95, volume 11, pp. 279–285. Elsevier, North-Holland, 1996.

  14. Omniorb web page. http://omniorb.sourceforge.net.

  15. A. Pope. The CORBA Reference Guide: Understanding the Common Object Request Broker Architecture. Addison-Wesley, Reading, MA, USA, Dec. 1997.

    Google Scholar 

  16. Y. Saad. Iterative methods for sparse linear systems, second edition. SIAM, 2003.

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

    Article  MATH  MathSciNet  Google Scholar 

  18. R. S. Varga. Matrix iterative analysis. Prentice-Hall, 1962.

Download references

Author information

Authors and Affiliations

  1. Laboratoire d'Informatique de Franche-Comté (LIFC), IUT de Belfort-Montbéliard, BP 527, 90016, Belfort, France

    Jacques M. Bahi, Sylvain Contassot-Vivier & Raphaël Couturier

Authors
  1. Jacques M. Bahi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Sylvain Contassot-Vivier
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Raphaël Couturier
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jacques M. Bahi.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Bahi, J.M., Contassot-Vivier, S. & Couturier, R. Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms. J Supercomput 35, 227–244 (2006). https://doi.org/10.1007/s11227-006-4667-8

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-006-4667-8

Keywords

Search

Navigation