Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04) Deadline Scheduling with Priority for Client-Server Systems on the Grid Pittsburgh, PA November 08-November 08 ISBN: 0-7695-2256-4
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/GRID.2004.18
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.
Citation:
Eddy Caron, Pushpinder Kaur Chouhan, Fr?d?ric Desprez, "Deadline Scheduling with Priority for Client-Server Systems on the Grid," grid, pp.410-414, Fifth IEEE/ACM International Workshop on Grid Computing (GRID'04), 2004 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb