Efficient Block Cyclic Data Redistribution

Loïc Prylli 1 Bernard Tourancheau 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Implementing linear algebra kernels on distributed memory parallel computers raises the problem of data distribution of matrices and vectors among the processors. Block-cyclic distribution seems to suit well for most algorithms. But one has to choose a good compromise for the size of the blocks (to achieve a good computation and communication efficiency and a good load balancing). This choice heavily depends on each operation, so it is essential to be able to go from one distribution to another very quickly. We present here the algorithms we implemented in the SCALAPACK library. A complexity study is made that proves the efficiency of our solution. Timing results on the Intel Paragon and the Cray T3D corroborates the results. We show the gain that can be obtained using the good data distribution with 3 numerical kernels and our redistribution routines.
Document type :
Reports
Complete list of metadatas

Cited literature [2 references]  Display  Hide  Download

https://hal.inria.fr/inria-00073925
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 2:06:08 PM
Last modification on : Monday, December 10, 2018 - 10:54:05 AM
Long-term archiving on : Sunday, April 4, 2010 - 9:45:47 PM

Identifiers

  • HAL Id : inria-00073925, version 1

Collections

Citation

Loïc Prylli, Bernard Tourancheau. Efficient Block Cyclic Data Redistribution. [Research Report] RR-2766, INRIA. 1996. ⟨inria-00073925⟩

Share

Metrics

Record views

143

Files downloads

459