Non Linear Divisible Loads: There is No Free Lunch

Olivier Beaumont 1, 2 Hubert Larchevêque 1, 2 Loris Marchal 3, 4
1 CEPAGE - Algorithmics for computationally intensive applications over wide scale distributed platforms
Université Sciences et Technologies - Bordeaux 1, Inria Bordeaux - Sud-Ouest, École Nationale Supérieure d'Électronique, Informatique et Radiocommunications de Bordeaux (ENSEIRB), CNRS - Centre National de la Recherche Scientifique : UMR5800
3 ROMA - Optimisation des ressources : modèles, algorithmes et ordonnancement
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Divisible Load Theory (DLT) has received a lot of attention in the past decade. A divisible load is a perfect parallel task, that can be split arbitrarily and executed in parallel on a set of possibly heterogeneous resources. The success of DLT is strongly related to the existence of many optimal resource allocation and scheduling algorithms, what strongly differs from general scheduling theory. Moreover, recently, close relationships have been underlined between DLT, that provides a fruitful theoretical framework for scheduling jobs on heterogeneous platforms, and MapReduce, that provides a simple and efficient programming framework to deploy applications on large scale distributed platforms. The success of both have suggested to extend their framework to non-linear complexity tasks. In this paper, we show that both DLT and MapReduce are better suited to workloads with linear complexity. In particular, we prove that divisible load theory cannot directly be applied to quadratic workloads, such as it has been proposed recently. We precisely state the limits for classical DLT studies and we review and propose solutions based on a careful preparation of the dataset and clever data parti- tioning algorithms. In particular, through simulations, we show the possible impact of this approach on the volume of communications generated by MapReduce, in the context of Matrix Multiplication and Outer Product algorithms.
Type de document :
Communication dans un congrès
IPDPS 2013, 27th IEEE International Parallel & Distributed Processing Symposium, May 2013, Boston, United States. 2013
Liste complète des métadonnées

Littérature citée [38 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00771640
Contributeur : Olivier Beaumont <>
Soumis le : mercredi 9 janvier 2013 - 10:12:48
Dernière modification le : vendredi 20 avril 2018 - 15:44:27
Document(s) archivé(s) le : mercredi 10 avril 2013 - 03:49:13

Fichier

nofreelunch.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00771640, version 1

Citation

Olivier Beaumont, Hubert Larchevêque, Loris Marchal. Non Linear Divisible Loads: There is No Free Lunch. IPDPS 2013, 27th IEEE International Parallel & Distributed Processing Symposium, May 2013, Boston, United States. 2013. 〈hal-00771640〉

Partager

Métriques

Consultations de la notice

397

Téléchargements de fichiers

162