Preemptive and Non-Preemptive Real-Time UniProcessor Scheduling
Laurent George, Nicolas Rivierre, Marco Spuri · 1996
F10.75> j i U 1 r i max w i q , qT i -- ( ) r i C j j i 1 C j T j ------ j i < -- / = = 50 Theorem 23 - A upper bound of the worst-case response time of a task using EDF is . Proof. From last theorem, we have: . Thus , eliminating the floor function, we have: , that leads to: . As , we have : . o B.2 Sufficient Condition for fixed priority driven preemptive schedulers Using fixed priority driven schedulers, the following feasibility SC establishes upper-bounds on the worst-case response times. This result is established by first an overvaluation on ; and second by eliminating the term function of . Theorem 24 -