GREMLINS: a large sparse linear solver for grid environment

Abstract : Traditional largesparselinearsolvers are not suited in agrid computing environment as they require alarge amount of synchronization and communication penalizing the performance on this architecture. This paper presents some features of the solver designed during the current GREMLINS (GRid Efficient Method forLINear Systems) project. The GREMLINS solver limits the amount of communication as it is based on a coarse grained iterative method called multisplitting method. Moreover, the solver can be executed either in a synchronous or an asynchronous mode. In the latter case, iterations are desynchronized and there is no more synchronization at all. It may result in a faster execution time compared to the synchronous case. Some experiments presented in this paper with the GRID'5000 architecture, a nation wide experimental grid in France, allowed us to highlight interesting features of this solver.
Type de document :
Article dans une revue
Parallel Computing, Elsevier, 2008, 34 (6-8), pp.380-391. 〈10.1016/j.parco.2007.12.002〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00688658
Contributeur : Ist Rennes <>
Soumis le : mercredi 18 avril 2012 - 11:06:25
Dernière modification le : mercredi 21 mars 2018 - 18:57:59

Lien texte intégral

Identifiants

Citation

Raphaël Couturier, Christophe Denis, Fabienne Jézéquel. GREMLINS: a large sparse linear solver for grid environment. Parallel Computing, Elsevier, 2008, 34 (6-8), pp.380-391. 〈10.1016/j.parco.2007.12.002〉. 〈hal-00688658〉

Partager

Métriques

Consultations de la notice

155