Scheduling BoT applications in grids using a slave oriented adaptive algorithm

  • Ferreto T
  • De Rose C
  • Northfleet C
  • 1

    Readers

    Mendeley users who have this article in their library.
  • 0

    Citations

    Citations of this article.

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, i.e. 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. © Springer-Verlag Berlin Heidelberg 2004.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • PUI: 39739483
  • SCOPUS: 2-s2.0-35048868335
  • SGR: 35048868335
  • ISSN: 03029743

Authors

  • T. Ferreto

  • C. De Rose

  • C. Northfleet

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free