Lehoczky JP, Sha L, Ding Y (1989) The rate monotonic scheduling algorithm: exact characterization and average case behaviour. In: Proceedings of the 10th IEEE real-time systems symposium, Santa Monica, CA, December 1989, pp 166–171 Leung JY-T, Whitehead J (1982) On the complexity of fi...
Navet, "Near-Optimal Fixed Priority Preemptive Scheduling of Offset Free Systems", Proc. of the 14th International Conference on Network and Systems (RTNS'2006), Poitiers, France, May 30-31, 2006. [15] J. Palencia and M. G. Harbour, "Schedulability analysis for tasks with static and ...
5. Conclusion and Future Work The main contribution of this paper is an effective worst-case response time analysis 3 in the non-preemptive case with offsets and jitters. Though the algorithm is of exponential complexity, experiments show that it can be used on medium-size networks with ...
The scheduling model with IIT that is used in FTT-CAN is the Blocking-Free Non-Preemptive scheduling model [26]. Traffic schedulability in this model can be assessed as if the scheduling was fully preemptive, e.g., using common response time analysis (RTA) [27], as long as the message...