Deadline Scheduling with Priority for Client-Server Systems on the Grid

Authors:
Eddy Caron;Pushpinder Kaur Chouhan;Frederic Desprez
Affiliations:
LIP / ENS-Lyon, France;LIP / ENS-Lyon, France;LIP / ENS-Lyon, France
Venue:
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
Year:
2004

Citing 5
Cited 4

Design and implementations of Ninf: towards a global computing infrastructure

Future Generation Computer Systems - Special issue on metacomputing
The network weather service: a distributed resource performance forecasting service for metacomputing

Future Generation Computer Systems - Special issue on metacomputing
A Scalable Approach to Network Enabled Servers (Research Note)

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Simgrid: A Toolkit for the Simulation of Application Scheduling

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
A Study of Deadline Scheduling for Client-Server Systems on the Computational Grid

HPDC '01 Proceedings of the 10th IEEE International Symposium on High Performance Distributed Computing

A general distributed scalable grid scheduler for independent tasks

Journal of Parallel and Distributed Computing
A general distributed scalable peer to peer scheduler for mixed tasks in grids

HiPC'07 Proceedings of the 14th international conference on High performance computing
Online algorithms for advance resource reservations

Journal of Parallel and Distributed Computing
Enhancing security of real-time applications on grids through dynamic scheduling

JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 multi-client, multi-server 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.