Parameterized Schedulability Analysis on Uniform Multiprocessors

This paper addresses global rate-monotonic scheduling of implicit-deadline periodic real-time tasks on uniform multiprocessor platforms. In particular, we propose new schedulability conditions that include a set of easily com-putable task-set parameters for achieving better system uti-lization while meeting the deadlines of all the tasks. First, an individual sufficient schedulability condition is derived for each task. Then, the collection of schedulability con-ditions for the tasks are condensed to provide two differ-ent simple sufficient schedulability conditions for the entire task system — one for uniform multiprocessors, and one for unit-capacity multiprocessors, respectively. Finally, we show that our proposed simple rate-monotonic schedula-bility conditions for uniform and unit-capacity multiproces-sors have higher worst-case system utilization than all other state-of-the-art simple schedulability conditions for global rate-monotonic scheduling of implicit-deadline tasks.