Paper Info
Title
Scheduling with uncertainties on new computing platforms
Abstract
New distributed computing platforms (grids) are based on interconnections of a large number of processing elements. A most important issue for their effective utilization is the optimal use of resources through proper task scheduling. It consists of allocating the tasks of a parallel program to processors on the platform and to determine at what time the tasks will start their execution. As data may be subject to uncertainties or disturbances, it is practically impossible to precisely predict the input parameters of the task scheduling problem.We briefly survey existing approaches for dealing with data uncertainties and discuss their relevance in the context of grid computing. We describe the stabilization process and analyze a scheduling algorithm that is intrinsically stable (i.e., it mitigates the effects of disturbances in input data at runtime). This algorithm is based on a decomposition of the application graph into convex sets of vertices. Finally, it is compared experimentally to pure on-line and well-known off-line algorithms.
Year
DOI
Venue
2011
10.1007/s10589-009-9311-0
Comp. Opt. and Appl.
Keywords
DocType
Volume
Optimization,Heuristics,Uncertainties,Stability,Scheduling,Grid computing
Journal
48
Issue
ISSN
Citations 
2
0926-6003
7
PageRank 
References 
Authors
0.47
22
3
Name
Order
Citations
PageRank
Amine Mahjoub181.21
Johnatan E. Pecero242523.82
Denis Trystram31120160.57