ComprehensiveBench: a Benchmark for the Extensive Evaluation of Global Scheduling Algorithms

15th Brazilian Symposium on High Performance Computational Systems

计算机科学

Pilla, Laércio L.^1 ; Bozzetti, Tiago C.^2 ; Castro, Márcio^1 ; Navaux, Philippe O.A.^2 ; Méhaut, Jean-François^3

Department of Informatics and Statistics, Technology Center, Federal University of Santa Catarina, Florianopolis, Brazil^1

Informatics Institute, Federal University of Rio Grande Do sul, Porto Alegre, Brazil^2

University of Grenoble Alpes, LIG, CEA-INRIA, Grenoble, France^3

关键词: Charm++;    Communication behavior;    Comparing algorithm;    Parallel application;    Parallel platforms;    Periodic load;    Task distribution;   

Others  :  https://iopscience.iop.org/article/10.1088/1742-6596/649/1/012007/pdf
DOI  :  10.1088/1742-6596/649/1/012007

学科分类：计算机科学（综合）

来源: IOP

【 摘 要 】

Parallel applications that present tasks with imbalanced loads or complex communication behavior usually do not exploit the underlying resources of parallel platforms to their full potential. In order to mitigate this issue, global scheduling algorithms are employed. As finding the optimal task distribution is an NP-Hard problem, identifying the most suitable algorithm for a specific scenario and comparing algorithms are not trivial tasks. In this context, this paper presents ComprehensiveBench, a benchmark for global scheduling algorithms that enables the variation of a vast range of parameters that affect performance. ComprehensiveBench can be used to assist in the development and evaluation of new scheduling algorithms, to help choose a specific algorithm for an arbitrary application, to emulate other applications, and to enable statistical tests. We illustrate its use in this paper with an evaluation of Charm++ periodic load balancers that stresses their characteristics.