Accounting for interrupt handling costs in dynamic priority task systems
- 30 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 212-221
- https://doi.org/10.1109/real.1993.393497
Abstract
In order to apply the results of formal studies of real-time task models, a practitioner must account for the effects of phenomena present in the implementation but not present in the formal model. We study the feasibility and schedulability problems for periodic tasks that must compete for the processor with interrupt handlers -- tasks that are assumed to always have priority over application tasks. The emphasis in the analysis is on deadline driven scheduling methods. We develop conditions that solve the feasibility and schedulability problems and demonstrate that our solutions are computationally feasible. Lastly, we compare our analysis with others developed for static priority task systems.Keywords
This publication has 6 references indexed in Scilit:
- The rate monotonic scheduling algorithm: exact characterization and average case behaviorPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Scheduling sporadic tasks with shared resources in hard-real-time systemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On non-preemptive scheduling of period and sporadic tasksPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Fixed priority scheduling periodic tasks with varying execution priorityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Engineering and analysis of fixed priority schedulersIEEE Transactions on Software Engineering, 1993
- Scheduling Algorithms for Multiprogramming in a Hard-Real-Time EnvironmentJournal of the ACM, 1973