Bounding the Number of Self-Blocking Occurrences of SIRAP

Abstract

This paper presents a new schedulability analysis for hierarchically scheduled real-time systems executing on a single processor using SIRAP, a synchronization protocol for inter subsystem task synchronization. We show that it is possible to bound the number of self-blocking occurrences that should be taken into consideration in the schedulability analysis of subsystems. Correspondingly, we present two novel schedulability analysis approaches with proof of correctness for SIRAP. An evaluation suggests that this new schedulability analysis can decrease the analytical subsystem utilization significantly.