6533b831fe1ef96bd1298343

RESEARCH PRODUCT

Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling

Patricia BalbastreIsmael RipollAlfons Crespo

subject

Rate-monotonic schedulingTheoretical computer scienceComputer scienceServerResponse timeDynamic priority schedulingParallel computingTemporal isolationUpper and lower boundsFair-share schedulingScheduling (computing)

description

Hierarchical scheduling has recently been used to provide temporal isolation to embedded virtualised systems. Response time analysis is a common way to derive a schedulability test for these systems. This paper points out that response time analysis for hierarchical fixed-priority scheduling found in the literature is only exact for tasks of the highest priority domain. For the rest of the tasks is an upper bound. In our work, we provide the exact analysis and we compare it with previously published works.

yearjournalcountryeditionlanguage
2009-08-012009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
https://doi.org/10.1109/rtcsa.2009.40