Robust scheduling of metaprograms

    Authors

    L. Boloni;D. C. Marinescu

    Comments

    Authors: contact us about adding a copy of your work at STARS@ucf.edu

    Abbreviated Journal Title

    J. Sched.

    Keywords

    scheduling; robustness; resource reservation; Engineering, Manufacturing; Operations Research & Management Science

    Abstract

    Scheduling coarse-grain tasks, e.g. metaprograms on a grid, uses estimation of the execution times of individual components to compute optimal schedules. Various factors (hazards) lead to estimation errors, which affect both the performance of the schedule and its resource utilization. We introduce the concept of robustness of a schedule and present an analysis technique to determine the chance that a metaprogram exceeds its execution time due to components outside its critical path. The results of this analysis are used to compute schedules less sensitive to hazards. This translates into more accurate reservation requirements for critical systems, and reduced expected execution time for noncritical metaprograms executed repeatedly. We introduce the concept of the entropy of a schedule and conjecture that a more robust schedule is one that minimizes the entropy of a schedule. Copyright (C) 2002 John Wiley Sons, Ltd.

    Journal Title

    Journal of Scheduling

    Volume

    5

    Issue/Number

    5

    Publication Date

    1-1-2002

    Document Type

    Article; Proceedings Paper

    Language

    English

    First Page

    395

    Last Page

    412

    WOS Identifier

    WOS:000178142600004

    ISSN

    1094-6136

    Share

    COinS