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 61 for “"priority scheduling"”.

  1. Learning Dynamic Priority Scheduling Policies with Graph Attention Networks

    … network-based models to automatically learn scheduling policies for effectively solving resource optimization problems, covering both deterministic and stochastic environments. The policy learning methods utilize both imitation learning, when expert demonstrations are accessible at low cost, …

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

  2. A Data Driven Priority Scheduling technique for a Stream Processing Platform

    … processing engines is the lack of support for priority scheduling. There are cases where businesses need to ensure that important input data items are processed with low latencies thus avoiding a missed business opportunity. This thesis proposes a technique that enables users to prioritize …

    carleton Repository record for A Data Driven Priority Scheduling technique for a Stream Processing Platform (opens in a new tab)

  3. A UNIFIED HARDWARE/SOFTWARE PRIORITY SCHEDULING MODEL FOR GENERAL PURPOSE SYSTEMS

    … co-design approaches to address scheduling issues such as latency and jitter. Many hardware based approaches have been reported to reduce the latency of computing the scheduling decision function itself. However continued adherence to classic scheduler invocation mechanisms can …

    ku Repository record for A UNIFIED HARDWARE/SOFTWARE PRIORITY SCHEDULING MODEL FOR GENERAL PURPOSE SYSTEMS (opens in a new tab)

  4. Priority scheduling revisited: Dominant rules, open protocols and integrated order management

    The task of job shop scheduling – determining the sequence and timing of jobs on available resources – is one of the most discussed practical problems in operations management. There are many appropriate problem definitions for job shop scheduling due to the complex and dynamic nature of the …

    aalto Repository record for Priority scheduling revisited: Dominant rules, open protocols and integrated order management (opens in a new tab)

  5. Fixed-Priority Scheduling of Periodic Tasks With End-to-End Deadlines

    … the framework, the thesis proposes an end-to-end scheduling based approach to the resource contention problem in distributed real-time systems. Simulation results show that the end-to-end scheduling approach performs better in many cases than an existing approach, known as the Multiprocessor …

    uiuc Repository record for Fixed-Priority Scheduling of Periodic Tasks With End-to-End Deadlines (opens in a new tab)

  6. An Improved Static-Priority Scheduling Algorithm for Multi-Processor Real-Time Systems

    … with the problem of designing a new real-time scheduling algorithm for independent periodic tasks with static priority on multi-processor platforms called IBSP-TS (Interval Based Semi-Partitioned Task Splitting). The widely implemented priority policy Rate-Monotonic is applied in the algorithm. …

    chalmers Repository record for An Improved Static-Priority Scheduling Algorithm for Multi-Processor Real-Time Systems (opens in a new tab)

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

  8. An investigation of the job-type performance of priority scheduling in manufacturing cells

    … variation in the job-type performance of the scheduling rules. It may be looked upon as an exploratory study since there is a lack of published results in this field of scheduling literature. Some fundamental questions regarding the job-type performance of a typical manufacturing cell are …

    ttu Repository record for An investigation of the job-type performance of priority scheduling in manufacturing cells (opens in a new tab)

  9. Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling

    … multicore architectures with partitioned fixed-priority scheduling. In this thesis, we propose to judiciously assign task offset, task priority, and task communication mechanism, to avoid simultaneous access to shared memory by tasks on different cores, to preserve the model semantics, and to …

    vt Repository record for Optimal Implementation of Simulink Models on Multicore Architectures with Partitioned Fixed Priority Scheduling (opens in a new tab)

  10. Performance modelling and analysis of e-commerce systems using class based priority scheduling. An investigation into the development of new class based priority scheduling mechanisms for e-commerce system combining different techniques.

    … proposed approach is based on the class-based priority scheme that classifies E-commerce requests into different classes. Because no single technique can solve all aspects of overload problems, this research combines several techniques including: admission control mechanism, session-based …

    bradford Repository record for Performance modelling and analysis of e-commerce systems using class based priority scheduling. An investigation into the development of new class based priority scheduling mechanisms for e-commerce system combining different techniques. (opens in a new tab)

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

    The 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)

  12. Efficient Packet Scheduling in Wireless Multihop Networks

    … certain mechanisms to incorporate differentiated priority scheduling, such that higher priority traffic can be transmitted in preference to lower priority traffic. The ""location dependent channel contention"" and ""hidden terminals"" make priority scheduling significantly different from that in …

    uiuc Repository record for Efficient Packet Scheduling in Wireless Multihop Networks (opens in a new tab)

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

    … scenarios, the processing capabilities and scheduling strategies of singleprocessor platforms are increasingly unable to meet the growing computational demands of real-time tasks. To host more and more functions with additional processing requirements and stricter real-time constraints, …

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

  14. Schedulability Analysis of Multi-Phase Limited-Preemption Tasks

    … time. We then extend the MPS model to fixed-priority scheduling by adapting prior algorithms for fixed-priority, limited-preemption task sets. Next, we consider representing the MPS problem as a constraint program. We demonstrate that such a program can feasibly solve the MPS scheduling …

    wustl Repository record for Schedulability Analysis of Multi-Phase Limited-Preemption Tasks (opens in a new tab)

Page 1 of 4