2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2009)
Aug. 24, 2009 to Aug. 26, 2009
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/RTCSA.2009.40
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.
Hierarchical systems, fixed-priority schedulig
I. Ripoll, P. Balbastre and A. Crespo, "Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling," 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications(RTCSA), Beijing, China, 2009, pp. 315-320.