Comparison of the Conjugate Gradient of NAS benchmark and of the Multisplitting algorithm with the Jace environment

Abstract : The aim of this paper is to study the behaviors of the well known conjugate gradient (CG) algorithm and the multisplitting algorithm in a grid context. We focus on the CG implementation used in the NAS benchmark and on the multisplitting approach which produces similar results (from a numerical point of view). By grid context we mean an architecture composed of several heterogeneous clusters geographically distributed and the use of a software environment able to tackle the heterogeneity of the nodes. Under these hypothesis, we performed a set of experiments on the Grid'5000 platform using the pure Java Jace V2 environment. We show that, by drastically reducing global synchronizations, the asynchronous multi-splitting method outperforms the NAS CG implementation, with distant sites, whatever the communication protocol used.
Type de document :
Communication dans un congrès
IPDPS'08, ACM/IEEE Interantional Parallel and Distributed Processing Symposium, Apr 2008, Miami, United States. 2008, 〈10.1109/IPDPS.2008.4536334〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00684442
Contributeur : Ist Rennes <>
Soumis le : lundi 2 avril 2012 - 10:31:39
Dernière modification le : vendredi 6 juillet 2018 - 15:06:08

Identifiants

Citation

Jacques Bahi, Raphaël Couturier, David Laiymani. Comparison of the Conjugate Gradient of NAS benchmark and of the Multisplitting algorithm with the Jace environment. IPDPS'08, ACM/IEEE Interantional Parallel and Distributed Processing Symposium, Apr 2008, Miami, United States. 2008, 〈10.1109/IPDPS.2008.4536334〉. 〈hal-00684442〉

Partager

Métriques

Consultations de la notice

58