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
Contributor : Rapport de Recherche Inria
<>
Submitted on : Wednesday, May 24, 2006 - 1:08:45 PM
Last modification on : Wednesday, March 13, 2019 - 3:02:06 PM
Long-term archiving on : Sunday, April 4, 2010 - 9:33:51 PM
