Article révisé par les pairs
Résumé : n this work, we address the scheduling of sporadic tasks on auniprocessor under preemptive fixed-priority policies, incorporating bothstarting and resuming delays. Starting and resuming delays represent theextra time, relative to the task’s execution time, necessary to first start ajob or to resume it after a preemption. In this study, we consider thatthese delays are introduced by a protection mechanism executed by eachtask before starting and resuming, yet the theoretical results are generaland apply for other sources of delays. For this model, there is no responsetime analysis in the literature. We propose the first schedulability testbased on a response time analysis, which computes an upper bound on theworst-case response time. We then discuss and evaluate the pessimism ofthe proposed schedulability test and the worst-case response time bound.