Parameterized Schedulability Analysis on Uniform Multiprocessors
Paper in proceeding, 2010

This paper addresses global Rate-Monotonic (RM) 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 computable task-set parameters for achieving better system utilization while meeting the deadlines of all the tasks. First, an individual sufficient schedulability condition is derived for each task. Then, the collection of schedulability conditions for the tasks are condensed to provide two different 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 schedulability conditions for uniform and unit-capacity multiprocessors 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.

Uniform multiprocessors

Realtime scheduling

Rate-monotonic scheduling

Global multiprocessor scheduling

Real-time systems


Risat Pathan

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Jan Jonsson

Chalmers, Computer Science and Engineering (Chalmers), Computer Engineering (Chalmers)

Proceedings of the International Conference on Parallel Processing (ICPP), San Diego, CA, September 13-16, 2010

0190-3918 (ISSN)

978-076954156-3 (ISBN)

Subject Categories

Computer Engineering

Computer Science

Areas of Advance

Information and Communication Technology





More information