Abstract : This paper presents a discussion on 2D block mappings for the sparse Cholesky factorization on parallel MIMD architectures with distributed memory. It introduces the fan-in algorithm in a general manner and proposes several mapping strategies. The grid mapping with row balancing, inspired from Rothberg's work proved to be more robust than the original fan-out algorithm. Even more efficient is the proportional mapping, as show the experiments on a 32 processors IBM SP1 and on a Cray T3D. Subforest-to-subcube mappings are also considered and give good results on the T3D.
https://hal.inria.fr/inria-00073533
Contributeur : Rapport de Recherche Inria
<>
Soumis le : mercredi 24 mai 2006 - 13:08:45
Dernière modification le : mercredi 11 avril 2018 - 01:53:46
Document(s) archivé(s) le : dimanche 4 avril 2010 - 21:33:51
