Generalized offset based response time analysis

In real-time theory, there exist two approaches for computing the response time of tasks: the classical response time analysis (RTA) approach and the modular performance analysis with the Real-Time Calculus (MPA-RTC). The classical RTA techniques are based on the busy window methods and the response time equation needs to be adapted every time a new scheduling policy or a new event activation pattern is considered in the system model. MPA-RTC has its roots in Network Calculus (NC). MPA-RTC offers more powerful abstraction and exibility than the RTA based techniques, because of its ability to model resource availability and arbitrary incoming activations with the help of expressive service curves and arrival curves respectively. MPA-RTC models scheduling policy with the help of service curves and can handle hierarchical scheduling better than RTA based techniques. In this paper, we propose a generalized approach to model offset dependencies using MPA-RTC based technique to compute tight worst-case response times of tasks