Scheduling block-cyclic array redistribution

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. 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 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 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
Complete list of metadatas

https://hal.inria.fr/hal-00856849
Contributor : Equipe Roma <>
Submitted on : Monday, September 2, 2013 - 4:04:52 PM
Last modification on : Wednesday, December 12, 2018 - 3:36:03 PM

Identifiers

Collections

Citation

Frédéric Desprez, Jack Dongarra, Antoine Petitet, Cyril Randriamaro, Yves Robert. Scheduling block-cyclic array redistribution. IEEE Transactions on Parallel and Distributed Systems, Institute of Electrical and Electronics Engineers, 1998, 9 (2), pp.192-205. ⟨10.1109/71.663945⟩. ⟨hal-00856849⟩

Share

Metrics

Record views

234