Skip to Main content Skip to Navigation
Theses

Nouvelles approches pour l'ordonnancement d'applications parallèles sous contraintes de déploiement d'environnements sur grappe.

Abstract : This thesis considers the \textit{Clusters} in Grid'5000 (French Project for the grids). Grid'5000 is an experimental platform which makes possible for researchers to submit their programs associating them with an excution environment. Usually, the deployment process on nodes has some problems. One of them is the failure of the machines because the excessive boot of the deployment phases can cause their endomagement. Thus, we consider the bicriteria scheduling problem to solve the scheduling problem with deployment on cluster. The first criteria to minimize is the number of deployments of all machines. The second one is to minimize the makespan. We define an algorithm "Groups List Scheduling" denoted by GLS, based on a bujet approach with relaxation of the optimality constraints. Using this approach, we define a (alpha, beta)-budget-relaxed-approximate solution for the bicriteria optimisation problem. When we consider the bicriteria scheduling problem with deployment, the GLS algorithm gives a (4,2)-budget-relaxe-approximate solution. We have defined a polynomial algorithm that allows the construction of a (4+epsilon,2)-approximate Pareto curve from the results obtained by the GLS algoritm. In the next step we consider the bicriteria scheduling problem with deployment, using the Pareto curve approach. We define a plynomial algorithm which builds, from GLS algorithm, a (4+epsilon,2)-approximate Pareto curve solutions. An experimental analysis gives the performance of the GLS algorithm and allows us to validate the approximation ratios.
Complete list of metadatas

Cited literature [53 references]  Display  Hide  Download

https://tel.archives-ouvertes.fr/tel-00311957
Contributor : Feryal-Kamila Moulaï <>
Submitted on : Friday, August 22, 2008 - 3:33:03 PM
Last modification on : Tuesday, December 8, 2020 - 10:26:08 AM
Long-term archiving on: : Friday, October 5, 2012 - 11:49:04 AM

Identifiers

  • HAL Id : tel-00311957, version 1

Collections

Citation

Feryal-Kamila Moulaï. Nouvelles approches pour l'ordonnancement d'applications parallèles sous contraintes de déploiement d'environnements sur grappe.. Modélisation et simulation. Université Joseph-Fourier - Grenoble I, 2007. Français. ⟨tel-00311957⟩

Share

Metrics

Record views

587

Files downloads

689