Exact Response Time Analysis of Hierarchical Fixed-Priority Scheduling

Authors:
Patricia Balbastre;Ismael Ripoll;Alfons Crespo
Affiliations:
-;-;-
Venue:
RTCSA '09 Proceedings of the 2009 15th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Year:
2009

Citing 0
Cited 3

ORK+/XtratuM: an open partitioning platform for Ada

Ada-Europe'11 Proceedings of the 16th Ada-Europe international conference on Reliable software technologies
RT-Xen: towards real-time hypervisor scheduling in xen

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Ada real-time services and virtualization

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.