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

Laércio Lima Pilla (1) , Tiago Bozetti (2) , Marcio Castro (1) , Philippe Navaux (2) , Jean-François Méhaut (3)

1 UFSC - Universidade Federal de Santa Catarina = Federal University of Santa Catarina [Florianópolis]
2 UFRGS - Instituto de Informática da UFRGS
3 CORSE - Compiler Optimization and Run-time Systems

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.

Domaines: Calcul parallèle, distribué et partagé [cs.DC]

Laércio Lima Pilla, Tiago Bozetti, Marcio Castro, Philippe Navaux, Jean-François Méhaut. ComprehensiveBench: a Benchmark for the Extensive Evaluation of Global Scheduling Algorithms. Journal of Physics: Conference Series, 2015, pp.1-12. ⟨hal-01183558⟩