By Topic

Efficient scheduling heuristics for GridRPC systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Caniou, Y. ; LORIA, INRIA, Nancy, France ; Jeannot, E.

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.

Published in:

Parallel and Distributed Systems, 2004. ICPADS 2004. Proceedings. Tenth International Conference on

Date of Conference:

7-9 July 2004