IEEE Transactions on Parallel and Distributed Systems
Experiments with Scheduling Using Simulated Annealing in a Grid Environment
GRID '02 Proceedings of the Third International Workshop on Grid Computing
Predicting Application Run Times Using Historical Information
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Dynamic Matching and Scheduling of a Class of Independent Tasks onto Heterogeneous Computing Systems
HCW '99 Proceedings of the Eighth Heterogeneous Computing Workshop
Heuristics for Scheduling Parameter Sweep Applications in Grid Environments
HCW '00 Proceedings of the 9th Heterogeneous Computing Workshop
Characterization of Backfilling Strategies for Parallel Job Scheduling
ICPPW '02 Proceedings of the 2002 International Conference on Parallel Processing Workshops
A Comparison among Grid Scheduling Algorithms for Independent Coarse-Grained Tasks
SAINT-W '04 Proceedings of the 2004 Symposium on Applications and the Internet-Workshops (SAINT 2004 Workshops)
A low-cost rescheduling policy for efficient mapping of workflows on grid systems
Scientific Programming - AxGrids 2004
Scientific Programming - AxGrids 2004
Adaptive grid job scheduling with genetic algorithms
Future Generation Computer Systems
Are user runtime estimates inherently inaccurate?
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Population-based metaheuristics for tasks scheduling in heterogeneous distributed systems
NMA'10 Proceedings of the 7th international conference on Numerical methods and applications
| Hi-index | 0.01 |
Grids are very dynamic and their workload is impossible to predict. As a result systems using them need to offer mechanisms for adapting to the new configurations. To address this issue many scheduling policies have been created. In a Grid environment in which tasks needing to be scheduled arrive constantly it is costly to lend some computing resources to only one request consisting of jobs and postpone all others as long as the current one is executing. As a result a scheduling algorithm which minimizes each task's estimated execution time by considering the total waiting time of a task, the relocation to a faster resource once a threshold has been reached and the fact that it should not be physically relocated at each reassignment should be considered. This paper tries to offer a solution based on the above. To validate the model a comparison with other scheduling algorithms is performed.