Efficient Scheduling Heuristics for GridRPC Systems

Yves Caniou 1 Emmanuel Jeannot 1
1 ALGORILLE - Algorithms for the Grid
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In this paper we examine several scheduling heuristics for GridRPC middleware relying on the time-shared model (a server can execute more than one task at a time). Our work is based on a forecast module called the ‘Historical Trace Manager' (HTM), which is able to predict durations of tasks in the system. We show that the predictions performed by the HTM are very accurate. The five proposed scheduling heuristics use these predictions to map submitted tasks to servers. Experimental simulation results show that they are able to outperform the well-known MCT heuristic for several metrics (makespan but also sumflow, max-stretch, etc.) and therefore provide a better quality of service for the client.
Type de document :
Communication dans un congrès
QOS and Dynamic System Workshop of ICPADS'2004 - 10th International Conference on Parallel and Distributed Systems, 2004, New-Port Beach, California/USA, IEEE, pp.621--630, 2004
Liste complète des métadonnées

https://hal.inria.fr/inria-00100130
Contributeur : Publications Loria <>
Soumis le : mardi 26 septembre 2006 - 10:14:27
Dernière modification le : jeudi 11 janvier 2018 - 06:19:48

Identifiants

  • HAL Id : inria-00100130, version 1

Collections

Citation

Yves Caniou, Emmanuel Jeannot. Efficient Scheduling Heuristics for GridRPC Systems. QOS and Dynamic System Workshop of ICPADS'2004 - 10th International Conference on Parallel and Distributed Systems, 2004, New-Port Beach, California/USA, IEEE, pp.621--630, 2004. 〈inria-00100130〉

Partager

Métriques

Consultations de la notice

244