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

Static-Priority Scheduling on Multiprocessors

Björn Andersson (Institutionen för datorteknik) ; Sanjoy Baruah ; Jan Jonsson (Institutionen för datorteknik)
Proceedings of the IEEE Real-Time Systems Symposium, December 3−6, 2001, London, England p. 193−202. (2001)
[Konferensbidrag, refereegranskat]

The preemptive scheduling of systems of periodic tasks on a platform comprised of several identical processors is considered. A scheduling algorithm is proposed for static-priority scheduling of such systems; this algorithm is a simple extension of the uniprocessor rate-monotonic scheduling algorithm. It is proven that this algorithm successfully schedules any periodic task system with a worst-case utilization no more than a third the capacity of the multiprocessor platform. It is also shown that no static-priority multiprocessor scheduling algorithm (partitioned or global) can guarantee schedulability for a periodic task set with a utilization higher than one half the capacity of the multiprocessor platform.

Nyckelord: Real-time scheduling, multiprocessor systems, partitioned scheduling, global scheduling, fixed-priority scheduling, preemptive scheduling, Dhall's effect

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

Läs mer om Chalmers styrkeområden  

Denna post skapades 2006-09-12. Senast ändrad 2011-04-14.
CPL Pubid: 10101


Institutioner (Chalmers)

Institutionen för datorteknik (1985-2001)


Informations- och kommunikationsteknik

Chalmers infrastruktur