Scheduling Analysis of Fixed Priority Hard Real-Time Systems with Multiframe

Scheduling analysis of real time systems has been studied by most re-searchers assuming the tasks of the systems have constant worst case execution time bounds during their cycle of execution. However, this is not the case in a multiframe task where the execution time could be dif-ferent from one instance to another, as in multimedia applications like MPEG. Some researchers have introduced sufficient scheduling analyses for a restricted model of multiframe tasks. The contributions in this thesis present scheduling analysis for a less strict model of multiframe tasks. The analysis is presented in two steps. In the first step, exact scheduling analysis is presented by response time analysis; where the worst case response time of multiframe tasks is formulated. This formulation is then extended to multiframe tasks that are subjected to blocking, release jitter and arbitrary deadlines. Another extension of the formulation i