Response Time Analysis for Fixed Priority Servers

Abstract

In the automotive domain, existing scheduling primitives do not suffice for complex integration scenarios involving heterogeneous applications with diverse timing requirements. Thus, there is a renewed interest to establish server based scheduling as a mainstream scheduling paradigm in automotive software development and to that end, we provide a response time analysis that provides tighter bounds than the existing state-of-the-art approaches for a system containing deferrable and periodic servers. Our proposed approach can also analyze periodic tasks with offsets and tasks with backlogged activations. We further perform experiments on LITMUSRT in order to demonstrate the tightness of the proposed response time analysis.