Exact scheduling analysis of non-accumulatively monotonic multiframe tasks

Abstract

In this paper, we present exact analysis for the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is developed in four stages. Firstly, we present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how their number can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with arbitrary deadlines. Thirdly, the basic analysis is extended to cope with frame specific deadlines. Lastly, the two models of frame specific deadlines and arbitrary deadlines are combined and the relative analysis is presented. An optimal priority assignment scheme for the frame specific deadline scenario is also presented in this paper.