Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 7 of 7 for “"Utility Accrual Real-Time Scheduling"”.

  1. Energy-Efficient, Utility Accrual Real-Time Scheduling

    In this dissertation, we consider timeliness and energy optimization in battery-powered, mobile embedded real-time systems. We focus on real-time systems that operate in environments with dynamically uncertain properties, including context-dependent activity execution times and arbitrary activity …

    vt Repository record for Energy-Efficient, Utility Accrual Real-Time Scheduling (opens in a new tab)

  2. Utility Accrual Real-Time Scheduling: Models and Algorithms

    This dissertation first presents an uniprocessor real-time scheduling algorithm called the Generic Benefit Scheduling algorithm (or GBS). GBS solves a previously open real-time scheduling problem: scheduling activities subject to arbitrarily shaped, time/utility function (TUF) time constraints and …

    vt Repository record for Utility Accrual Real-Time Scheduling: Models and Algorithms (opens in a new tab)

  3. Utility Accrual Real-Time Scheduling Under Variable Cost Functions

    We present a utility accrual real-time scheduling algorithm called CIC-VCUA, for tasks whose execution times are functions of their starting times. We model such variable execution times employing variable cost functions (or VCFs). The algorithm considers application activities that are subject to …

    vt Repository record for Utility Accrual Real-Time Scheduling Under Variable Cost Functions (opens in a new tab)

  4. On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors

    We consider the problem of scheduling real-time tasks on a multiprocessor system. Our primary focus is scheduling on multiprocessor systems where the total task utilization demand, U, is greater than m, the number of processors on a multiprocessor system---i.e., the total available processing …

    vt Repository record for On Best-Effort Utility Accrual Real-Time Scheduling on Multiprocessors (opens in a new tab)

  5. Optimality of Heuristic Schedulers in Utility Accrual Real-time Scheduling Environments

    Scheduling decisions in soft real-time environments are based on a utility function. The goal of such schedulers is to use a best-effort approach to maximize the utility function and ensure graceful degradation at overloads. Utility Accrual (UA) schedulers use heuristics to maximize the accrued …

    vt Repository record for Optimality of Heuristic Schedulers in Utility Accrual Real-time Scheduling Environments (opens in a new tab)

  6. Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs

    This dissertation presents a class of utility accrual scheduling and synchronization algorithms for dynamic, single and multiprocessor real-time systems. Dynamic real-time systems operate in environments with run-time uncertainties including those on activity execution times and arrival behaviors. …

    vt Repository record for Utility Accrual Real-Time Scheduling and Synchronization on Single and Multiprocessors: Models, Algorithms, and Tradeoffs (opens in a new tab)

  7. An Experimental Evaluation of the Scalability of Real-Time Scheduling Algorithms on Large-Scale Multicore Platforms

    … the scaling behaviors of existing multicore real-time task scheduling algorithms on large-scale multicore platforms. As chip manufacturers rapidly increase the core count of processors, it becomes imperative that multicore real-time scheduling algorithms keep pace. Thus, it must be determined …

    vt Repository record for An Experimental Evaluation of the Scalability of Real-Time Scheduling Algorithms on Large-Scale Multicore Platforms (opens in a new tab)