| HAL-Inria | Publications, software ... of Inria's scientists |
Conference papers
Comparison of Static and Dynamic Resource Allocation Strategies for Matrix Multiplication
Abstract : The tremendous increase in the size and heterogeneity of supercomputers makes it very difficult to predict the performance of a scheduling algorithm. In this context, relying on purely static scheduling and resource allocation strategies, that make scheduling and allocation decisions based on the dependency graph and the platform description, is expected to lead to large and unpredictable makespans whenever the behavior of the platform does not match the predictions. For this reason, the common practice in most runtime libraries is to rely on purely dynamic scheduling strategies, that make short-sighted scheduling decisions at runtime based on the estimations of the duration of the different tasks on the different available resources and on the state of the machine. In this paper, we consider the special case of Matrix Multiplication, for which a number of static allocation algorithms to minimize the amount of communications have been proposed. Through a set of extensive simulations, we analyze the behavior of static, dynamic, and hybrid strategies, and we assess the possible benefits of introducing more static knowledge and allocation decisions in runtime libraries.
Cited literature [27 references]
https://hal.inria.fr/hal-01163936
Contributor : Olivier Beaumont Connect in order to contact the contributor
Submitted on : Thursday, October 15, 2015 - 7:28:30 PM
Last modification on : Monday, December 20, 2021 - 4:50:14 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 11:58:24 PM
Contributor : Olivier Beaumont Connect in order to contact the contributor
Submitted on : Thursday, October 15, 2015 - 7:28:30 PM
Last modification on : Monday, December 20, 2021 - 4:50:14 PM
Long-term archiving on: : Wednesday, April 26, 2017 - 11:58:24 PM
File
PID3840069 (1).pdf
Files produced by the author(s)