Performance Comparison of Parallel Programming Environments for Implementing AIAC Algorithms

  • Authors:
  • Jacques M. Bahi;Sylvain Contassot-Vivier;Raphaël Couturier

  • Affiliations:
  • Laboratoire d'Informatique de Franche-Comté (LIFC), IUT de Belfort-Montbéliard, Belfort, France 90016;Laboratoire d'Informatique de Franche-Comté (LIFC), IUT de Belfort-Montbéliard, Belfort, France 90016;Laboratoire d'Informatique de Franche-Comté (LIFC), IUT de Belfort-Montbéliard, Belfort, France 90016

  • Venue:
  • The Journal of Supercomputing
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

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.