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 3 of 3 for “"demand bound function"”.

  1. A Machine Learning Based Approach for Fast Demand Characterization of Digraph Tasks

    … as loops. However, calculating the worst-case demand of a digraph can be time consuming, especially during online demand recharacterization. Inspired by recent advances in and successes of ML algorithms in solving problems in other application domains, we present a ML-based demand …

    vt Repository record for A Machine Learning Based Approach for Fast Demand Characterization of Digraph Tasks (opens in a new tab)

  2. An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks

    … This makes the rate of release of these jobs a function of the crankshaft's angular speed and acceleration. In addition, several properties of the engine triggered tasks like the execution time and deadlines are dependent on the speed profile of the crankshaft. Such tasks are referred to as …

    vt Repository record for An Efficient Knapsack-Based Approach for Calculating the Worst-Case Demand of AVR Tasks (opens in a new tab)

  3. Scheduling of Overload-Tolerant Computation and Multi-Mode Communication in Real-Time Systems

    … of tasks to meet their deadlines. Supply and demand bound functions can be used to analyze the schedulability of workloads. The demand-bound function determines the maximum required computational units for a given workload and the supply-bound function determines the minimum possible resources …

    waterloo Repository record for Scheduling of Overload-Tolerant Computation and Multi-Mode Communication in Real-Time Systems (opens in a new tab)