Efficient Scheduling Heuristics for GridRPC Systems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2004

Efficient Scheduling Heuristics for GridRPC Systems

Yves Caniou
  • Function : Author
  • PersonId : 830502
Emmanuel Jeannot


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.
Not file

Dates and versions

inria-00100130 , version 1 (26-09-2006)


  • HAL Id : inria-00100130 , version 1


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, pp.621--630. ⟨inria-00100130⟩
106 View
0 Download


Gmail Facebook Twitter LinkedIn More