DSpace À propos de l'application DSpace
 

Depot Institutionnel de l'UMBB >
Publications Scientifiques >
Communications Internationales >

Veuillez utiliser cette adresse pour citer ce document : http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/2282

Titre: CSP Formulation for scheduling independent jobs in Cloud Computing
Auteur(s): Mataoui, Mhamed
Sebbak, Faouzi
Beghdad Bey, Kada
Benhammadi, Farid
Mots-clés: CSP Formulation
Cloud Computing
scheduling independent jobs
Date de publication: 2015
Collection/Numéro: The 5th International Conference on Cloud Computing and Services Science (CLOSER 2015), At Lisbon, Portugal;PP. 1-2
Résumé: This paper investigates the use of Constraint Satisfaction Problem formulation to schedule independent jobs in heterogeneous cloud environment. Our formulation provides a basis for computing an optimal Makespan using job and machine reordering heuristics based on Min-min algorithm result. The combination of these heuristics with the weighted constraints allows improving the efficiency of the tree search algorithm to schedule jobs with considerable space search reduction. The proposed CSP model is validated through simulation experiments against clusters of 10 virtual machines. The results demonstrate that our model is able to efficiently allocate resources for jobs with significant performance gains between 18%-40% compared to the Min-Min heuristic results to optimize the Makespan
URI/URL: http://dlibrary.univ-boumerdes.dz:8080/handle/123456789/2282
Collection(s) :Communications Internationales

Fichier(s) constituant ce document :

Fichier Description TailleFormat
CSP Formulation for scheduling independent jobs in Cloud Computing.pdf89,06 kBAdobe PDFVoir/Ouvrir
View Statistics

Tous les documents dans DSpace sont protégés par copyright, avec tous droits réservés.

 

Valid XHTML 1.0! Ce site utilise l'application DSpace, Version 1.4.1 - Commentaires