Déploiement adaptatif d'applications parallèles : Algorithme de vol de travail appliqué au déploiement d'applications parallèles sur des grappes de grande taille

Cyrille Martin (1, 2) , Olivier Richard (1, 2) , Guillaume Huard (1, 2)

1 ID-IMAG - Informatique et Distribution
2 APACHE - Parallel algorithms and load sharing

This article presents a library named Taktuk for the deployment of applications on large sized clusters (thousands of nodes). This library is conceived for the development of interactive tools and thus has to complete a whole deployment in the shortest time. With this objective in mind, we show that the behavior of standard communication tools that we use can be modelized as a classical communication and we deduce from this a theoretical algorithm for optimal deployment. We then present our implementation choices that take into account the possible heterogeneity of the execution platform and the uncertainties about the value of some parameters. The evaluation of our tool highlights its near optimality and its adaptability that are essentially due to the work-stealing algorithm which is the heart of our system.

Mots clés: work stealing; deployment; cluster; grid; adaptative; parallel applications

Domaines: Autre [cs.OH]

Cyrille Martin, Olivier Richard, Guillaume Huard. Déploiement adaptatif d'applications parallèles : Algorithme de vol de travail appliqué au déploiement d'applications parallèles sur des grappes de grande taille. Revue des Sciences et Technologies de l'Information - Série TSI : Technique et Science Informatiques, 2005, 24 (5), pp.547-565. ⟨10.3166/tsi.24.547-565⟩. ⟨hal-00688760⟩