Skip to Main content Skip to Navigation

More on Scheduling Block-Cyclic Array Redistribution

Frédéric Desprez 1 Stéphane Domas Jack J. Dongarra Antoine Petitet Cyril Randriamaro Yves Robert 
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This article is devoted to the run-time redistribution of one-dimensional arrays that are distributed in a block-cyclic fashion over a processor grid. In a previous paper, we have reported how to derive optimal schedules made up of successive communication-steps. In this paper we assume that successive steps may overlap. We show how to obtain an optimal scheduling for the most general case, namely, moving from a CYCLIC(r) distribution on a P-processor grid to a CYCLIC(s) distribution on a Q-processor grid, for arbitrary values of the redistribution parameters P, Q, r, and s. We use graph-theoretic algorithms, and modular algebra techniques to derive these optimal schedulings.
Document type :
Complete list of metadata

Cited literature [1 references]  Display  Hide  Download
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Wednesday, May 24, 2006 - 12:01:36 PM
Last modification on : Friday, February 4, 2022 - 3:19:12 AM


  • HAL Id : inria-00073160, version 1



Frédéric Desprez, Stéphane Domas, Jack J. Dongarra, Antoine Petitet, Cyril Randriamaro, et al.. More on Scheduling Block-Cyclic Array Redistribution. [Research Report] RR-3524, LIP RR-1998-17, INRIA, LIP. 1998. ⟨inria-00073160⟩



Record views


Files downloads