By Topic

Deadline scheduling with priority for client-server systems on the grid

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
$33 $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

3 Author(s)
Caron, E. ; LIP, Ecole Normale Superieure de Lyon, France ; Chouhan, P.K. ; Desprez, F.

We present algorithms for the scheduling sequential tasks on a network enabled server (NES) environment. This article is an extension of the paper: "A Study of Deadline Scheduling for Client-Server Systems on the Computational Grid" by Takefusa et al. We mainly discuss a deadline scheduling with priority strategy that is more appropriate for multiclient, multiserver case. Importance is first given to the task's priority and then the task is allocated to the server that can meet the task's deadline. This may cause that some already allocated tasks on the server miss their deadline. We also augment the benefits of scheduling algorithms with load measurements (which is done with the use of a forecasting tool called FAST) and fallback mechanisms. The experimental results show that the deadline scheduling with priority along with fallback mechanism can increase the overall number of tasks executed by the NES.

Published in:

Grid Computing, 2004. Proceedings. Fifth IEEE/ACM International Workshop on

Date of Conference:

8-8 Nov. 2004