More on Scheduling Block-Cyclic Array Redistribution - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 1998

More on Scheduling Block-Cyclic Array Redistribution

Stéphane Domas
  • Function : Author
Jack J. Dongarra
  • Function : Author
Antoine Petitet
  • Function : Author
Cyril Randriamaro
  • Function : Author
  • PersonId : 1152814
  • IdRef : 135366259
Yves Robert


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.
Fichier principal
Vignette du fichier
RR-3524.pdf (242.33 Ko) Télécharger le fichier
RR1998-17.pdf (433.24 Ko) Télécharger le fichier

Dates and versions

inria-00073160 , version 1 (24-05-2006)


  • 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⟩
122 View
208 Download


Gmail Facebook X LinkedIn More