|Title:||Limited-preemptive fixed priority scheduling of real-time tasks on multiprocessors|
|Level:||Basic or Advanced (contact supervisor)|
The purpose of this thesis is to investigate the effectiveness of limited-preemptive scheduling of real-time tasks on multiprocessors using fixed preemption points under fixed priority scheduling.
Fixed preemption points: In this model each task is composed of several fixed preemption points in the task code, that specify non-preemptive regions (NPRs). If higher priority tasks are released during the execution of a non-preemptive region of a lower priority task, the scheduler waits until the NPR completes before rescheduling the tasks.
Many variants of limited preemptive scheduling for multiprocessors can be developed based on which of the currently executing tasks is preempted (remember that many tasks will be executing in parallel on multiprocessors).
There exists two main choices: 1) preempt the lowest priority task that becomes preemptible or 2) preempt the first executing lower priority task that becomes preemptible.
This thesis aims to investigate the two choices under the assumption of a global fixed priority scheduler by empirical comparison using synthetically generated tasksets.
|Prel. end date:||2015-05-27|