CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

Parameterized Schedulability Analysis on Uniform Multiprocessors

Risat Mahmud Pathan (Institutionen för data- och informationsteknik, Datorteknik (Chalmers)) ; Jan Jonsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers))
Proceedings of the International Conference on Parallel Processing (ICPP), San Diego, CA, September 13-16, 2010 (0190-3918). p. 323-332. (2010)
[Konferensbidrag, refereegranskat]

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.

Nyckelord: Global multiprocessor scheduling, Rate-monotonic scheduling, Real-time systems, Realtime scheduling, Uniform multiprocessors



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2010-06-08. Senast ändrad 2016-07-19.
CPL Pubid: 122470

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)