Budget-Deadline Constrained Workflow Planning for Admission Control

    Research output: Contribution to journalArticlepeer-review

    Abstract

    In this paper, we assume an environment with multiple, heterogeneous resources, which provide services of different capabilities and of a different cost. Users want to make use of these services to execute a workflow application, within a certain deadline and budget. The problem considered in this paper is to find a feasible plan for the execution of the workflow which would allow providers to decide whether they can agree with the specific constraints set by the user. If they agree to admit the workflow, providers can allocate services for its execution in a way that both deadline and budget constraints are met while account is also taken of the existing load in the provider's environment (confirmed reservations from other users whose requests have been accepted). A novel heuristic is proposed and evaluated using simulation with four different real-world workflow applications. © 2013 Springer Science+Business Media Dordrecht.
    Original languageEnglish
    Pages (from-to)633-651
    Number of pages18
    JournalJournal of Grid Computing
    Volume11
    Issue number4
    DOIs
    Publication statusPublished - Dec 2013

    Keywords

    • Admission control
    • Bi-criteria DAG scheduling
    • SLA-based resource reservation
    • Workflow planning

    Fingerprint

    Dive into the research topics of 'Budget-Deadline Constrained Workflow Planning for Admission Control'. Together they form a unique fingerprint.

    Cite this