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 8 of 8 for “"non-preemptive scheduling"”.

  1. Real-time system design using preemption thresholds

    … stage encounters a new problem. Traditional scheduling theory assumes a single level of task granularity. However, in industrial practice, common wisdom requires several design level tasks map into one run-time thread to reduce scheduling costs. This warrants a dual-level scheduling: …

    concordia Download PDF for Real-time system design using preemption thresholds (opens in a new tab)

  2. The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms

    … extend the theorem to pipeline systems running non-preemptive scheduling algorithm which may assign different relative priorities to a task on different stages.

    uiuc Repository record for The delay composition theorem on pipeline systems with non-preemptive priority varying scheduling algorithms (opens in a new tab)

  3. Approximation algorithms for linear programs and geometrically constrained packing roblems

    … In Chapter 4, we study two closely related scheduling problems, namely non-preemptive scheduling with fixed jobs and scheduling with non-availability for sequential jobs on m identical machines under the makespan objective, where m is constant. For the first problem, which does not admit an …

    cau-kiel Repository record for Approximation algorithms for linear programs and geometrically constrained packing roblems (opens in a new tab)

  4. Problems on decision making under uncertainty

    … Allocation. Further, in the stochastic setting, scheduling of decisions for the building portfolio recovery is even more computationally difficult than some of the other coarsely-modeled networks like Electric Power Networks (EPN). Our work proposes a stochastic non-preemptive scheduling …

    colostate Repository record for Problems on decision making under uncertainty (opens in a new tab)

  5. Group-EDF: A New Approach and an Efficient Non-Preemptive Algorithm for Soft Real-Time Systems

    … in terms of their implementation into preemptive and non-preemptive systems. In preemptive systems, tasks are often preempted by higher priority tasks. Non-preemptive systems are gaining interest for implementing soft-real applications on multithreaded platforms. In this dissertation, I …

    unt Repository record for Group-EDF: A New Approach and an Efficient Non-Preemptive Algorithm for Soft Real-Time Systems (opens in a new tab)

  6. Delay composition theory: A reduction-based schedulability theory for distributed real-time systems

    … (DAG), and subsequently generalize the result to non-acyclic task graphs as well, under both preemptive and non-preemptive scheduling. The result makes no assumptions on periodicity and is valid for periodic and aperiodic jobs. It applies to fixed and dynamic priority scheduling, as long as all …

    uiuc Repository record for Delay composition theory: A reduction-based schedulability theory for distributed real-time systems (opens in a new tab)

  7. Real-time hierarchical hypervisor

    … on other and often more practical types of scheduling constraints, especially the non-preemptive and limited-preemptive ones. Then we consider the current x86 architecture and explore the problems that need to be addressed for real-time recursive virtualization. We drill down on the problem …

    texas Repository record for Real-time hierarchical hypervisor (opens in a new tab)

  8. Approximate dynamic programming for weakly coupled Markov decision processes with perfect and imperfect information

    … below. Chapter 1 investigates a class of scheduling problems where dynamically and stochastically arriving appointment requests are either rejected or booked for future slots. A customer may cancel an appointment. A customer who does not cancel may fail to show up. The planner may overbook …

    washington Repository record for Approximate dynamic programming for weakly coupled Markov decision processes with perfect and imperfect information (opens in a new tab)