HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Scheduling Block-Cyclic Array Redistribution

Abstract : This article is devoted to the run-time redistribution of arrays that are distributed in a block-cyclic fashion over a multidimensional processor grid. While previous studies have concentrated on efficiently generating the communication messages to be exchanged by the processors involved in the redistribution, we focus on the {\em scheduling} of those messages: how to organize the message exchanges into «structured» communication steps that minimize contention. We build upon results of Walker and Otto, who solved a particular instance of the problem, and we derive an optimal scheduling for the most general case, namely, moving from a {\tt CYCLIC(r)} distribution on a $P$-processor grid to a {\tt CYCLIC(s)} distribution on a $Q$-processor grid, for {\em arbitrary} values of the redistribution parameters $P$, $Q$, $r$, and $s$.
Document type :
Complete list of metadata

Contributor : Rapport de Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 1:12:37 PM
Last modification on : Friday, February 4, 2022 - 3:32:43 AM
Long-term archiving on: : Sunday, April 4, 2010 - 10:02:56 PM


  • HAL Id : inria-00073573, version 1



Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, Yves Robert. Scheduling Block-Cyclic Array Redistribution. [Research Report] RR-3117, INRIA. 1997. ⟨inria-00073573⟩



Record views


Files downloads