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

Improved Schedulability Tests for Global Fixed-Priority Scheduling

Risat Mahmud Pathan (Institutionen för data- och informationsteknik, Nätverk och system, Datakommunikation och distribuerade system (Chalmers)) ; Jan Jonsson (Institutionen för data- och informationsteknik, Datorteknik (Chalmers) ; Institutionen för data- och informationsteknik, Nätverk och system (Chalmers) )
23rd Euromicro Conference on Real-Time Systems (ECRTS), July 6-8, 2011. p. 136-147 . (2011)
[Konferensbidrag, refereegranskat]

In this paper, global fixed-priority multiprocessor scheduling of a set of sporadic real-time tasks is addressed. First, we propose a priority-assignment policy, called ISM-US, for implicit-deadline task systems. Policy ISM-US assigns slack monotonic priorities to a subset of the given task set and other tasks are assigned the highest fixed priority. We prove that the schedulability utilization bound for policy ISM-US is higher than the corresponding bound for any other existing schedulability test for implicit-deadline sporadic task systems. Second, we propose improvements to two state-of-the-art iterative schedulability tests for constrained-deadline sporadic task systems. Our improved schedulability tests, called HP-RTA-LC and HP-DA-LC, are based on a hybrid-priority assignment policy and are shown to dominate the two existing state-of-the-art tests, RTA-LC and DA-LC, respectively. © 2011 IEEE

Nyckelord: Fixed-Priority; Global Scheduling; Multiprocessor; Optimal priority assignment; Real-Time Scheduling; Schedulability analysis; Utilization Bound



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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2011-05-01. Senast ändrad 2016-07-19.
CPL Pubid: 140097

 

Läs direkt!


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