Non-preemptive Scheduling Analysis of Periodic Task Sets with Overheads in an OSEK Compliant System

Schedulability analysis is very important for hard realtime systems. Classical analysis techniques of fixed priority scheduling do not integrate system overheads into the feasibility condition, so these theories and methods can not directly be applied in practical environments. This paper presents a method to compute the worst-case response time of non-preemptable periodic tasks in an OSEK compliant system, and then establishes the feasibility condition. The proposed method takes into account the identified main overheads of a typical OSEK system, and integrates these into classic analysis techniques. Experiment results show that the method is applicable and effective, and can be used in real-time system designs with an OSEK system.