Solving large sparse linear systems in a grid environment: the GREMLINS code versus the PETSc library

Abstract : Solving large sparse linear systems is essential in numerous scientific domains. Several algorithms, based on direct or iterative methods, have been developed for parallel architectures. On distributed grids consisting of processors located in distant geographical sites, their performance may be unsatisfactory because they suffer from too many synchronizations and communications. The GREMLINS code has been developed for solving large sparse linear systems on distributed grids. It implements the multisplitting method that consists in splitting the original linear system into several subsystems that can be solved independently. In this paper, the performance of the GREMLINS code obtained with several libraries for solving the linear subsystems is analyzed. Its performance is also compared with that of the widely used PETSc library that enables one to develop portable parallel applications. Numerical experiments have been carried out both on local clusters and on distributed grids.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01146527
Contributor : Lip6 Publications <>
Submitted on : Tuesday, April 28, 2015 - 2:49:35 PM
Last modification on : Thursday, March 21, 2019 - 1:03:20 PM

Links full text

Identifiers

Citation

Fabienne Jézéquel, Raphaël Couturier, Christophe Denis. Solving large sparse linear systems in a grid environment: the GREMLINS code versus the PETSc library. Journal of Supercomputing, Springer Verlag, 2012, 59 (3), pp.1517-1532. ⟨10.1007/s11227-011-0563-y⟩. ⟨hal-01146527⟩

Share

Metrics

Record views

124