The Community for Technology Leaders
Parallel and Distributed Processing Symposium, International (2008)
Miami, FL, USA
Apr. 14, 2008 to Apr. 18, 2008
ISBN: 978-1-4244-1693-6
pp: 1-7
Raphael Couturier , University of Franche-Comte (LIFC), IUT de Belfort-Montbéliard, Rue Engel Gros 90016 CEDEX - France
David Laiymani , University of Franche-Comte (LIFC), IUT de Belfort-Montbéliard, Rue Engel Gros 90016 CEDEX - France
Jacques M. Bahi , University of Franche-Comte (LIFC), IUT de Belfort-Montbéliard, Rue Engel Gros 90016 CEDEX - France
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 multisplitting method outperforms the NAS CG implementation, with distant sites, whatever the communication protocol used.
INDEX TERMS
CITATION
Raphael Couturier, David Laiymani, Jacques M. Bahi, "Comparison of the Conjugate Gradient of NAS benchmark and of the multisplitting algorithm with the Jace environment", Parallel and Distributed Processing Symposium, International, vol. 00, no. , pp. 1-7, 2008, doi:10.1109/IPDPS.2008.4536334
99 ms
(Ver 3.3 (11022016))