@inproceedings{08ed31521d83490a8b9397b6f6c2ab75,
title = "More on 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. In a previous paper, we have reported how to derive opti- mal 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) distri- bution on a Q-processor grid, for arbitrary values of the redistribution parameters P, Q, r, and s. We use graph-theoretic algorithms, and mo- dular algebra techniques to derive these optimal schedulings.",
keywords = "Asynchronous communications, Block-CYCLIC distribution, Distributed arrays, Hpf, Redistribution, Scheduling",
author = "Fr{\'e}d{\'e}ric Desprez and St{\'e}phane Domas and Jack Dongarra and Antoine Petitet and Cyril Randriamaro and Yves Robert",
year = "1998",
doi = "10.1007/3-540-49530-4\_20",
language = "English",
isbn = "3540651721",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "275--287",
booktitle = "Languages, Compilers, and Run-Time Systems for Scalable Computers - 4th International Workshop, LCR 1998, Selected Papers",
note = "4th International Workshop on Languages, Compilers, and Run-Time Systems for Scalable Computers, LCR 1998 ; Conference date: 28-05-1998 Through 30-05-1998",
}