Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Real-Time Systems
Schedulability of event-driven code blocks in real-time embedded systems
Proceedings of the 39th annual Design Automation Conference
Scheduling Algorithms
Dynamic- and Static-priority Scheduling of Recurring Real-time Tasks
Real-Time Systems
On the Complexity of Scheduling Conditional Real-Time Code
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Schedulability of generalized multiframe task sets under static priority assignment
RTCSA '97 Proceedings of the 4th International Workshop on Real-Time Computing Systems and Applications
A multiframe model for real-time tasks
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Approximate Schedulability Analysis
RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
The Limited-Preemption Uniprocessor Scheduling of Sporadic Task Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
The Non-preemptive Scheduling of Periodic Tasks upon Multiprocessors
Real-Time Systems
Improving task responsiveness with limited preemptions
ETFA'09 Proceedings of the 14th IEEE international conference on Emerging technologies & factory automation
Dynamic alteration schemes of real-time schedules for I/O device energy efficiency
ACM Transactions on Embedded Computing Systems (TECS)
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Strictly periodic scheduling in IMA-based architectures
Real-Time Systems
| Hi-index | 0.00 |
The recurring real-time task model was recently proposed as a model for real-time processes that contain code with conditional branches. In this paper, we present a necessary and sufficient condition for uniprocessor nonpreemptive schedulability analysis for this task model. We also derive a polynomial-time approximation algorithm for testing this condition. Preemptive schedulers usually have a larger schedulability region compared to their nonpreemptive counterparts. Further, for most realistic task models, schedulability analysis for the non-preemptive version is computationally more complex compared to the corresponding preemptive version. Our results in this paper show that (surprisingly) the recurring real-time task model does not fall in line with these intuitive expectations, i.e. there exists polynomial-time approximation algorithms for both preemptive and non-preemptive versions of schedulability analysis. This has important implications on the applicability of this model, since fully preemptive scheduling algorithms often have significantly larger runtime overheads.