Solving large sparse linear systems in a grid environment using Java

Abstract : In this paper, we show how to solve large sparse linear systems in a grid environment using the Java language and the MPJ library for communication. We describe a parallel version of the GMRES method which takes into account the sparsity of the matrix for message exchanges among processors. Two implementations are compared: one in Java using MPJ and one in C using MPI. The performance of both codes is also compared with that of the PETSc library. Experiments have been carried out using the GRID'5000 platform, on the one hand, on a local cluster, and, on the other hand, on clusters located in distant geographical sites. It is noticeable that the performance of our solver in Java is comparable to the same solver written in C and also to the PETSc library. Our solver in Java allowed us to solve sparse systems of size up to 2 billions with two geographically distant sites.
Type de document :
Communication dans un congrès
PDSEC'10, 11th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing, joint to IPDPS'10, 24th ACM/IEEE International Parallel and Distributed Processing Symposium, Apr 2010, Atlanta, United States. IEEE, pp.1-7, 2010, 〈10.1109/IPDPSW.2010.5470713〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00684552
Contributeur : Ist Rennes <>
Soumis le : lundi 2 avril 2012 - 14:45:53
Dernière modification le : jeudi 11 janvier 2018 - 06:26:38

Identifiants

Citation

Raphaël Couturier, Fabienne Jézéquel. Solving large sparse linear systems in a grid environment using Java. PDSEC'10, 11th IEEE International Workshop on Parallel and Distributed Scientific and Engineering Computing, joint to IPDPS'10, 24th ACM/IEEE International Parallel and Distributed Processing Symposium, Apr 2010, Atlanta, United States. IEEE, pp.1-7, 2010, 〈10.1109/IPDPSW.2010.5470713〉. 〈hal-00684552〉

Partager

Métriques

Consultations de la notice

104