More on Scheduling Block-Cyclic Array Redistribution

Frédéric Desprez 1 Stéphane Domas Jack 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.
Type de document :
RR-3524, INRIA. 1998
Liste complète des métadonnées
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:01:36
Dernière modification le : jeudi 8 février 2018 - 11:08:22
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:36:18



  • HAL Id : inria-00073160, version 1



Frédéric Desprez, Stéphane Domas, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, et al.. More on Scheduling Block-Cyclic Array Redistribution. RR-3524, INRIA. 1998. 〈inria-00073160〉



Consultations de la notice


Téléchargements de fichiers