Paper Info
Title
A bi-objective scheduling algorithm for desktop grids with uncertain resource availabilities
Abstract
In this work, we consider the execution of applications on desktop grids. Such parallel systems use idle computing resources of desktops distributed over the Internet for running massively parallel computations. The applications are composed of workflows of independent non-preemptive sequential jobs that are submitted by successive batches. Then, the corresponding jobs are executed on the distributed available resources according to some scheduling policy. However, most resources are not continuously available over time since the users give their idle CPU time only for some time when they are not using their desktops. Moreover, even if the dates of unavailability periods are estimated in advance, they are subject to uncertainties. This may drastically impact the global performances by delaying the completion time of the applications. The aim of this paper is to study how to schedule efficiently a set of jobs in the presence of unavailability periods on identicalmachines. In the same time, we are interested in reducing the impact of disturbances on the unavailability periods. This is achieved bymaximizing the stability thatmeasures the distance between the makespan of the disturbed instance over the initial one. Our main contribution is the design of a new parametrized algorithm and the analysis of its performance through structural properties. This algorithm reduces the impact of disturbances on availability periods without worsening too much the makespan. Its interest is assessed by running simulations based on realistic workflows.Moreover, theoretical results are obtained under the assumption that the size of every availability interval is at least twice the size of the largest job.
Year
Venue
Keywords
2011
Euro-Par (2)
new parametrized algorithm,idle cpu time,available resource,availability interval,uncertain resource availability,parallel system,parallel computation,completion time,unavailability period,desktop grid,idle computing resource,bi-objective scheduling algorithm,availability period
Field
DocType
Volume
Job shop scheduling,Massively parallel,Scheduling (computing),Computer science,CPU time,Idle,Parallel computing,Real-time computing,Unavailability,Workflow,Distributed computing,The Internet
Conference
6853
ISSN
Citations 
PageRank 
0302-9743
2
0.38
References 
Authors
12
4
Name
Order
Citations
PageRank
Louis-Claude Canon110311.67
Adel Essafi220.72
Grégory Mounié31289.68
Denis Trystram41120160.57