Feasibility analysis determines (prior to system execution-time) whether a specified collection of hard-realtime jobs executed on a processing platform can meet all deadlines. In...
Abstract The multiprocessor scheduling of collections of real-time jobs is considered. Sufficient tests are derived for feasibility analysis of a collection of sporadic jobs where ...
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
Schedulability tests are presented for preemptive earliest-deadline-first and deadline-monotonic scheduling of periodic or sporadic real-time tasks on a singlequeue Ñ-server sys...
We consider schemes for enacting task share changes—a process called reweighting—on real-time multiprocessor platforms. Our particular focus is reweighting schemes that are de...
Aaron Block, James H. Anderson, UmaMaheswari C. De...