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 “"priority scheduling"”.
-
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 …
-
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 …
-
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 …
-
Discrete-time queueing models with priorities
… analyses of several discrete-time two-class priority queueing systems. We analyze non-preemptive, preemptive resume as well as preemptive repeat priority queues. The analyses are heavily based on probability generating functions that allow us to calculate moments and tail probabilities of the …
-
General Secondary School Principals' and Athletic Directors' Experiences Regarding the Priority of Selected Athletic Department Tasks and the Time Required to Accomplish Them
… This question was investigated by comparing the priority given to each task by the principals and the athletic directors; by evaluating the rank order of each task as given by each group; by contrasting the differences in the start date as indicated for each task by the principals and athletic …
-
MCFlow: Middleware for Mixed-Criticality Distributed Real-Time Systems
<p>Traditional fixed-priority scheduling analysis for periodic/sporadic task sets is based on the assumption that all tasks are equally critical to the correct operation of the system. Therefore, every task has to be schedulable under the scheduling policy, and estimates of tasks' worst case …
-
On Intelligent Mitigation of Process Starvation In Multilevel Feedback Queue Scheduling
… with the conclusion that recent emphasis on priority scheduling and heurstic interactivity determination makes such a comparison impossible. Research then continued with simulations in which MLFQ-NS was given different run- time arguments than original simulations. Investigations into those …
-
ReSHAPE: A Framework for Dynamic Resizing of Parallel Applications
… parallel job schedulers only support static scheduling, so that the number of processors allocated to an application cannot be changed at runtime. As a result, it is common to see jobs stuck in the queue because they require just a few more processors than are currently available, resulting …
-
Improving Throughput and Efficiency for WLAN: Sounding, Grouping, Scheduling
… the users in OFDMA-based WLAN. We define a User Priority Scheduling (UPS) criterion that strictly guarantees service requests of the spectrum and time resources for the users with higher priorities before guaranteeing resources to those of lower priority. We develop an optimization framework to …
-
Processing graphs and sparse matrices efficiently
Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-05-01
-
Delay composition theory: A reduction-based schedulability theory for distributed real-time systems
… 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 jobs have the same relative priority on all stages on which they execute. …