Preemptive priority-based scheduling: an appropriate engineering approach
Advances in real-time systems
Scheduling Fixed-Priority Tasks with Preemption Threshold
RTCSA '99 Proceedings of the Sixth International Conference on Real-Time Computing Systems and Applications
Biasing Effects in Schedulability Measures
ECRTS '04 Proceedings of the 16th Euromicro Conference on Real-Time Systems
Bounding the Maximum Length of Non-preemptive Regions under Fixed Priority Scheduling
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Resilience analysis: tightening the CRPD bound for set-associative caches
Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems
Preemption Points Placement for Sporadic Task Sets
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Scalable real-time system design using preemption thresholds
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Job Phasing Aware Preemption Deferral
EUC '11 Proceedings of the 2011 IFIP 9th International Conference on Embedded and Ubiquitous Computing
Limited preemptive scheduling of non-independent task sets
Proceedings of the Eleventh ACM International Conference on Embedded Software
| Hi-index | 0.00 |
While the earliest deadline first algorithm is known to be optimal as a uniprocessor scheduling policy, the implementation comes at a cost in terms of complexity. Fixed task-priority algorithms on the other hand have lower complexity but higher likelihood of task sets being declared unschedulable, when compared to earliest deadline first (EDF). Various attempts have been undertaken to increase the chances of proving a task set schedulable with similar low complexity. In some cases, this was achieved by modifying applications to limit preemptions, at the cost of flexibility. In this work, we explore several variants of a concept to limit interference by locking down the ready queue at certain instances. The aim is to increase the prospects of schedulability of a given task system, without compromising on complexity or flexibility, when compared to the regular fixed task-priority algorithm. As a final contribution, a new preemption threshold assignment algorithm is provided which is less complex and more straightforward than the previous method available in the literature.