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 20 of 26 for “"Dynamic priority"”.

  1. Learning Dynamic Priority Scheduling Policies with Graph Attention Networks

    … parts. Part 1) Scheduling with stochastic and dynamic task completion times. The MRTA problem is extended by introducing human coworkers with dynamic learning curves and stochastic task execution. HybridNet, a hybrid network structure, has been developed that utilizes a heterogeneous …

    gatech Repository record for Learning Dynamic Priority Scheduling Policies with Graph Attention Networks (opens in a new tab)

  2. Dynamic priority rules for cyclic queues with limited service regime

    A cyclic service system with two stations operating under limited service regime has been analyzed, assuming poisson arrivals and exponential service at each service station. Zero switch-over times have been assumed. A thorough simulation study has been conducted, and guidelines have been obtained …

    iastate Repository record for Dynamic priority rules for cyclic queues with limited service regime (opens in a new tab)

  3. Multiprocessor scheduling with practical constraints

    … scheduling heuristic using a list scheduler with dynamically computed priorities. The dynamic priority heuristic is compared against an optimal scheduler and against other researchers’ approaches for thousands of randomly generated scheduling problems. The dynamic priority heuristic produces …

    ucf Repository record for Multiprocessor scheduling with practical constraints (opens in a new tab)

  4. Global scheduling of real-time tasks on multiprocessors based on priority promotion

    … tasks cannot be scheduled feasibly under fixed-priority assignments. To overcome the limitations of fixed-priority scheduling, it becomes necessary to introduce some form of dynamic priority. Although the schedulers under dynamic-priority may perform better in terms of schedulability, they are …

    chalmers Repository record for Global scheduling of real-time tasks on multiprocessors based on priority promotion (opens in a new tab)

  5. Improving Controllers for Formations and Deconfliction among Non-holonomic Vehicles

    … methods generality lies on the ability to define dynamic formations so as to smoothly switch between different configurations , where the robots can change both of their relative coordinates as they move. It is also possible to acquire a desired formation given an initial random configurations.The …

    unr Repository record for Improving Controllers for Formations and Deconfliction among Non-holonomic Vehicles (opens in a new tab)

  6. Fixed-Priority Scheduling Algorithms with Multiple Objectives in Hard Real-Time Systems

    In the context ofFixed-Priority Scheduling in Real-Time Systems, we investigate scheduling mechanisms for supporting systems where, in addition to timing constraints, their performance with respect to additional QoS requirements must be improved. This'type of situation may occur when the worst-case …

    whiterose Download PDF for Fixed-Priority Scheduling Algorithms with Multiple Objectives in Hard Real-Time Systems (opens in a new tab)

  7. K-Priority Scheduling of Hard Real-Time Implicit-Deadline Periodic Task Systems on Uniprocessor

    … Rate Monotonic (RM) scheduling algorithm (static priority scheme) has an advantage in that it is simple to implement and incurs less run time overhead. It however has a disadvantage that it cannot guarantee 100% utilization of the processor for many tasks set having 100% tasks utilization. The …

    chalmers Repository record for K-Priority Scheduling of Hard Real-Time Implicit-Deadline Periodic Task Systems on Uniprocessor (opens in a new tab)

  8. ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION

    … to delay between compute phases. We propose a dynamic priority mechanism realized by OpenFlow protocol on such an infrastructure with a preferred QoS policy over all other tra ffic. Moreover, our proposed priority mechanism can be enhanced if additional network information on traffi c in the …

    houston Repository record for ACCELERATING DATA-INTENSIVE COMPUTATIONS THROUGH DYNAMIC NETWORK TRAFFIC OPTIMIZATION (opens in a new tab)

  9. Schedulability analysis of resource access control protocols in real-time systems

    … behavior of the systems must be predictable. Priority driven scheduling algorithms, such as the earliest deadline first algorithm, are known to be effective and predictable in scheduling independent tasks. However, when concurrent tasks share resources in a mutually exclusive manner, the …

    uiuc Repository record for Schedulability analysis of resource access control protocols in real-time systems (opens in a new tab)

  10. QoS provision for haptic communication over the Tactile Internet

    … bilateral teleoperation applications. Assuming a dynamic priority queuing system serving URLLC traffic as high priority, under certain conditions, prioritisation causes resource starvation for trac of lower priority. On the other hand, without guaranteed QoS, bilateral teleoperation system …

    kings Repository record for QoS provision for haptic communication over the Tactile Internet (opens in a new tab) Download PDF for QoS provision for haptic communication over the Tactile Internet (opens in a new tab)

  11. Performance Analysis of a Multi-Class, Preemptive Priority Call Center with Time-Varying Arrivals

    … center as a an $M_{t}/M/n$, preemptive-resume priority queue with time-varying arrival rates and two priority classes of customers. The low priority customers have a dynamic priority where they become high priority if their waiting time exceeds a given service-level time. The performance of the …

    maryland Repository record for Performance Analysis of a Multi-Class, Preemptive Priority Call Center with Time-Varying Arrivals (opens in a new tab)

  12. Multiuser Usability of Collaborative Virtual Environments

    … and standard factors of usability. Moreover, a dynamic priority (DP) model that considers the vital need of EII is proposed to address the shortcomings of traditional models. The proposed DP model grants interaction opportunities to users based on the recency of their gained accesses. …

    calgary Repository record for Multiuser Usability of Collaborative Virtual Environments (opens in a new tab)

  13. Simulation modeling for complex decision-making in healthcare delivery systems

    … we evaluate the ability of HCCM to model a dynamic priority system making complex dispatch decisions. In this research, we also illustrate the implementation of our resulting HCCM models in state-of-the-art healthcare simulation software, FlexSim Healthcare (FlexSim HC). Standard DES …

    auckland-ms Repository record for Simulation modeling for complex decision-making in healthcare delivery systems (opens in a new tab)

  14. Real-time System Scheduling and Information Theory: From Uniprocessors to Multiprocessors

    … (SITSA-RT). When compared with other global, dynamic-priority algorithms, SITSA-RT significantly reduces the number of job migrations (up to 41.65% when compared against the selected EDF-based algorithms, and up to 93.22% when compared against the selected PFair-based algorithms). We also …

    houston Repository record for Real-time System Scheduling and Information Theory: From Uniprocessors to Multiprocessors (opens in a new tab)

  15. Dynamic routing and service network design for less-than-truckload (LTL) motor carriers

    <p>This research tries to address the dynamic priority shipment routing problem and dynamic service network design problem for the less-than-truckload (LTL) carriers. First, described is a decision support tool to assist LTL managers in studying, analyzing and planning LTL operations so that scarce …

    iastate Repository record for Dynamic routing and service network design for less-than-truckload (LTL) motor carriers (opens in a new tab)

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

    … such as full kernel preemptibility and priority inheritance for kernel locking primitives. ChronOS extends these capabilities with a flexible, scalable real-time scheduling framework. Our study shows that it is possible to implement global fixed and dynamic priority and simple global …

    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)

  17. Constrained Reinforcement Learning for Wireless Networks

    We first consider dynamic priority resource allocation for media streaming applications at a wireless edge (access) network. We realize that by formulating the policy design question as a CMDP, and decompose it into single-client problems by applying a Lagrangian relaxation, the optimal policy …

    tamu Repository record for Constrained Reinforcement Learning for Wireless Networks (opens in a new tab)

  18. Resource management for Edge computing systems

    … demonstrates a decision-making technique that dynamically decides on the appropriate amount of computation to be offloaded in the Cloud-Edge system. This is realised through a dynamic distribution mechanism that takes the context of the Edge environment (e.g. the resource availability of the …

    qu-belfast Repository record for Resource management for Edge computing systems (opens in a new tab) Download PDF for Resource management for Edge computing systems (opens in a new tab)

  19. Quality of service optimization of multimedia traffic in mobile networks

    … a novel queuing system known as the Time-Space Priority (TSP) scheme is proposed for multimedia traffic QoS control. TSP provides customized preferential treatment to the constituent flows in the multimedia traffic to suit their diverse QoS requirements. With TSP queuing, the real-time component …

    southwales Repository record for Quality of service optimization of multimedia traffic in mobile networks (opens in a new tab) Download PDF for Quality of service optimization of multimedia traffic in mobile networks (opens in a new tab)

  20. Multimedia services in DS/CDMA cellular networks : Erlang capacity and scheduling schemes

    … policy combined with a number of centralized dynamic priority based packet-level schedulers is proposed for providing soft QoS guarantees for multimedia traffic while achieving a high channel utilization. In the reservation scheme, the number of packets selected for transmission from a session …

    ubc Repository record for Multimedia services in DS/CDMA cellular networks : Erlang capacity and scheduling schemes (opens in a new tab) Download PDF for Multimedia services in DS/CDMA cellular networks : Erlang capacity and scheduling schemes (opens in a new tab)

Page 1 of 2