Sciweavers

IPPS
2006
IEEE

Schedulability analysis of non-preemptive recurring real-time tasks

14 years 5 months ago
Schedulability analysis of non-preemptive recurring real-time tasks
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, s...
Sanjoy K. Baruah, Samarjit Chakraborty
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where IPPS
Authors Sanjoy K. Baruah, Samarjit Chakraborty
Comments (0)