An adaptive scheduling method for grid computing

Authors:
Salah-Salim Boutammine;Daniel Millot;Christian Parrot
Affiliations:
Département Informatique, GET / INT, Évry, France;Département Informatique, GET / INT, Évry, France;Département Informatique, GET / INT, Évry, France
Venue:
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Year:
2006

Citing 5
Cited 6

Scheduling Divisible Loads in Parallel and Distributed Systems

Scheduling Divisible Loads in Parallel and Distributed Systems
Ten Reasons to Use Divisible Load Theory

Computer
Scheduling Distributed Applications: the SimGrid Simulation Framework

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Practical Divisible Load Scheduling on Grid Platforms with APST-DV

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
A Runtime Scheduling Method for Dynamic and Heterogeneous Platforms

ICPPW '06 Proceedings of the 2006 International Conference Workshops on Parallel Processing

MPI Applications on Grids: A Topology Aware Approach

Euro-Par '09 Proceedings of the 15th International Euro-Par Conference on Parallel Processing
Extending IC-scheduling via the Sweep Algorithm

Journal of Parallel and Distributed Computing
QCG-OMPI: MPI applications on grids

Future Generation Computer Systems
A New Grid Scheduler with Failure Recovery and Rescheduling Mechanisms: Discussion and Analysis

Journal of Grid Computing
On scheduling dag s for volatile computing platforms: Area-maximizing schedules

Journal of Parallel and Distributed Computing
Improving Performance on Data-Intensive Applications Using a Load Balancing Methodology Based on Divisible Load Theory

International Journal of Parallel Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents an adaptive scheduling method, which can be used for parallel applications whose total workload is unknown a priori. This method can deal with the unpredictable execution conditions commonly encountered on grids. To address this scheduling problem, parameters which quantify the dynamic nature of the execution conditions had to be defined. The proposed scheduling method is based on an on-line algorithm so as to be adaptable to the varying execution conditions, but avoids the idle periods inherent to this on-line algorithm.