More on Scheduling Block-Cyclic Array Redistribution

Authors:
Frederic Desprez;Stéphane Domas;Jack Dongarra;Antoine Petitet;Cyril Randriamaro;Yves Robert
Affiliations:
-;-;-;-;-;-
Venue:
LCR '98 Selected Papers from the 4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers
Year:
1998

Citing 3
Cited 1

Handbook of combinatorics (vol. 1)

Handbook of combinatorics (vol. 1)
Scheduling Block-Cyclic Array Redistribution

IEEE Transactions on Parallel and Distributed Systems
Runtime performance of parallel array assignment: an empirical study

Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing

Efficient multidimensional data redistribution for resizable parallel computations

ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications

Quantified Score

Hi-index	0.00

Visualization

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.