Research Article

Usage SLA-based scheduling in Grids

  1. Catalin L. Dumitrescu1,*,
  2. Ioan Raicu2,
  3. Ian Foster2,3

Article first published online: 28 SEP 2006

DOI: 10.1002/cpe.1091

Issue

Concurrency and Computation: Practice and Experience

Concurrency and Computation: Practice and Experience

Special Issue: Autonomous Grid Computing

Volume 19, Issue 7, pages 945–963, May 2007

Additional Information

How to Cite

Dumitrescu, C. L., Raicu, I. and Foster, I. (2007), Usage SLA-based scheduling in Grids. Concurrency Computat.: Pract. Exper., 19: 945–963. doi: 10.1002/cpe.1091

Author Information

  1. 1

    Department of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands

  2. 2

    Computer Science Department, The University of Chicago, 5801 South Ellis Avenue, Chicago, IL 60637, U.S.A.

  3. 3

    Mathematics and Computer Science Division, Argonne National Laboratory, 9700 South Cass Avenue, MCS/221, Argonne, IL 60439, U.S.A.

*Department of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD Delft, The Netherlands

Publication History

  1. Issue published online: 26 MAR 2007
  2. Article first published online: 28 SEP 2006
  3. Manuscript Accepted: 5 MAY 2006
  4. Manuscript Received: 17 FEB 2006

Funded by

  • European Commission CoreGrid IST Project. Grant Number: 004265
  • NSF Information Technology Research GriPhyN Project. Grant Number: ITR-0086044

SEARCH

SEARCH BY CITATION

ARTICLE TOOLS

Get PDF (240K)

Keywords:

  • Grid computing;
  • scheduling;
  • USLAs

Abstract

Managing usage service level agreements (uSLAs) within environments that integrate participants and resources spanning multiple physical institutions is a challenging problem. Running workloads in such environments is often a similarly challenging problem owing to the scale of the environment, and to the resource partitioning based on various sharing strategies. Also, a resource may be taken down during a job execution, be improperly set up or fail job execution. Such elements have to be taken into account whenever targeting a Grid environment for problem solving. In this paper we explore uSLA-based scheduling on a real Grid, Grid3, by means of a specific workload (the BLAST workload) and a specific scheduling framework, GRUBER (an architecture and toolkit for resource uSLA specification and enforcement). The paper provides extensive experimental results and comparisons with other scheduling strategies. We also address, in great detail, the performance of different uSLA-based site selection strategies and the overall performance in scheduling workloads over Grid3 with workload sizes ranging from 10 to 10 000 jobs. Copyright © 2006 John Wiley & Sons, Ltd.

Get PDF (240K)