Searching for authors named "Laurent George" – sorted by Relevance.
-
Preemptive and Non-Preemptive Real-Time Uni-Processor Scheduling
- 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: , t
- Cited by 32 (1 self) – Add To MetaCart

