The design and implementation of the KOALA co-allocating grid scheduler

H.H. Mohamed, D.H.J. Epema

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

    19 Citations (Scopus)
    8 Downloads (Pure)

    Abstract

    In multicluster systems, and more generally, in grids, jobs may require co-allocation, i.e., the simultaneous allocation of resources such as processors and input .les in multiple clusters. While such jobs may have reduced runtimes because they have access to more resources, waiting for processors in multiple clusters and for the input .les to become available in the right locations, may introduce ine.ciencies. In this paper we present the design of KOALA, a prototype for processor and data co-allocation that tries to minimize these ine.ciencies through the use of its Close-to-Files placement policy and its Incremental Claiming Policy. The latter policy tries to solve the problem of a lack of support for reservation by local resource managers.
    Original languageEnglish
    Title of host publicationAdvances in Grid Computing - EGC 2005 (European Grid Conference, Amsterdam, The Netherlands, February 14-16, 2005. Revised Selected Papers)
    EditorsP.M.A. Sloot, A.G. Hoekstra, T. Priol, A. Reinefeld, M. Bubak
    Place of PublicationBerlin
    PublisherSpringer
    Pages640-650
    ISBN (Print)3-540-26918-5
    DOIs
    Publication statusPublished - 2005

    Publication series

    NameLecture Notes in Computer Science
    Volume3470
    ISSN (Print)0302-9743

    Fingerprint

    Dive into the research topics of 'The design and implementation of the KOALA co-allocating grid scheduler'. Together they form a unique fingerprint.

    Cite this