Scheduling bot applications in grids using a slave oriented adaptive algorithm

Authors:
Tiago Ferreto;César De Rose;Caio Northfleet
Affiliations:
Faculty of Informatics, PUCRS, Brazil;Faculty of Informatics, PUCRS, Brazil;HP, Brazil
Venue:
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
Year:
2004

Citing 6
Cited 0

Guided self-scheduling: A practical scheduling scheme for parallel supercomputers

IEEE Transactions on Computers
Factoring: a method for scheduling parallel loops

Communications of the ACM
Numerical recipes in C (2nd ed.): the art of scientific computing

Numerical recipes in C (2nd ed.): the art of scientific computing
Simgrid: A Toolkit for the Simulation of Application Scheduling

CCGRID '01 Proceedings of the 1st International Symposium on Cluster Computing and the Grid
A Class of Loop Self-Scheduling for Heterogeneous Clusters

CLUSTER '01 Proceedings of the 3rd IEEE International Conference on Cluster Computing
Scheduling divisible workloads on heterogeneous platforms

Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Efficient scheduling of Bag-of-Tasks (BoT) applications in a computational grid environment reveals several challenges due to its high heterogeneity, dynamic behavior, and space shared utilization. Currently, most of the scheduling algorithms proposed in the literature use a master-oriented algorithm, in which the master is the only responsible for choosing the best task size to send to each slave. We present in this paper a different approach whose main originality is to be slave-oriented, ie each slave locally determines, from a set of initial runs, which workload size is more adapted to its capacities and notifies the master of it. Finally, we show some measurements comparing our algorithm with other three well-known scheduling algorithms using the SimGrid toolkit.