Adaptive Scheduling for Master-Worker Applications on the Computational Grid

  • Elisa Heymann
  • Miquel A. Senar
  • Emilio Luque
  • Miron Livny
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1971)

Abstract

We address the problem of how many workers should be allocated for executing a distributed application that follows the master-worker paradigm, and how to assign tasks to workers in order to maximize resource efficiency and minimize application execution time. We propose a simple but effective scheduling strategy that dynamically measures the execution times of tasks and uses this information to dynamically adjust the number of workers to achieve a desirable efficiency, minimizing the impact in loss of speedup. The scheduling strategy has been implemented using an extended version of MW, a runtime library that allows quick and easy development of master-worker computations on a computational grid. We report on an initial set of experiments that we have conducted on a Condor pool using our extended version of MW to evaluate the effectiveness of the scheduling strategy.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2000

Authors and Affiliations

  • Elisa Heymann
    • 1
  • Miquel A. Senar
    • 1
  • Emilio Luque
    • 1
  • Miron Livny
    • 2
  1. 1.Unitat d’Arquitectura d’Ordinadors i Sistemes OperatiusUniversitat Autònoma de BarcelonaBarcelonaSpain
  2. 2.Department of Computer SciencesUniversity of Wisconsin- MadisonWisconsinUSA

Personalised recommendations