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 13 of 13 for “"Utility Accrual"”.

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

    … model where activities are subject to time/utility function (or TUF) time constraints, mutual exclusion constraints on concurrent sharing of non-CPU resources, timeliness requirements including assurances on individual activity timeliness behavior, and system-level energy consumption …

    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

    … activities subject to arbitrarily shaped, time/utility function (TUF) time constraints and mutual exclusion resource constraints. A TUF specifies the utility of completing an application activity as an application- or situation-specific function of when that activity completes. GBS considers the …

    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. Garbage Collection Scheduling for Utility Accrual Real-Time Systems

    Utility Accrual (UA) scheduling is a method of dynamic real-time scheduling that is designed to respond to overload conditions by producing a feasible schedule that heuristically maximizes a pre-defined metric of utility. Whereas utility accrual schedulers have traditionally focused on CPU …

    vt Repository record for Garbage Collection Scheduling for Utility Accrual Real-Time Systems (opens in a new tab)

  5. Utility Accrual Real-time Channel Establishment in Multi-hop Networks

    … properties are characterized using Jensen's Time Utility Functions (TUFs) that are non-increasing. The two algorithms are (1) Localized Decision for Utility accrual Channel Establishment (LocDUCE) and (2) Global Decision for Utility accrual Channel Establishment (GloDUCE). Since finding a feasible …

    vt Repository record for Utility Accrual Real-time Channel Establishment in Multi-hop Networks (opens in a new tab)

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

    … real-time tasks that are subject to time/utility function (or TUF) time constraints, which allow task urgency to be expressed independently of task importance---e.g., the most urgent task being the least important. The urgency/importance decoupling allowed by TUFs is especially important …

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

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

    … 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 utility. …

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

  8. 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)

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

    … of algorithms, including deadline-based and utility accrual scheduling algorithms. These algorithms are compared under metrics including schedulability, tardiness, deadline satisfaction ratio, and utility accrual ratio. We consider multicore platforms ranging from 8 to 48 cores. The …

    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)

  10. Utility-Aware Scheduling of Stochastic Real-Time Systems

    Time utility functions offer a reasonably general way to describe the complex timing constraints of real-time and cyber-physical systems. However, utility-aware scheduling policy design is an open research problem. In particular, scheduling policies that optimize expected utility accrual are needed …

    wustl Repository record for Utility-Aware Scheduling of Stochastic Real-Time Systems (opens in a new tab)

  11. New data structures, models, and algorithms for real-time resource management

    … real-time scheduling modules. Secondly, a new utility accrual model, i.e., UAM^+, is established for the resource management in real-time distributed systems. UAM^+ is constructed based on the timeliness of computation and communication. Most importantly, the interplay between computation and …

    njit Repository record for New data structures, models, and algorithms for real-time resource management (opens in a new tab)

  12. Collaborative Scheduling and Synchronization of Distributable Real-Time Threads

    … threads arrive arbitrarily, have time/utility function time constraints, access resources in an arbitrary way (e.g., arbitrary lock acquire/release order, arbitrary nestings), and are subject to arbitrary node crash failures and message losses. We analytically establish several …

    vt Repository record for Collaborative Scheduling and Synchronization of Distributable Real-Time Threads (opens in a new tab)

  13. Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems

    … task model where tasks are subject to Time/Utility Function (or TUF) end-to-end time constraints, and the scheduling optimality criterion of maximizing the total accrued utility. The algorithm makes three novel contributions. First, Gamma uses gossip for reliably propagating task scheduling …

    vt Repository record for Scheduling Distributed Real-Time Tasks in Unreliable and Untrustworthy Systems (opens in a new tab)