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

Global Priority-Driven Aperiodic Scheduling on Multiprocessors

Björn Andersson (Institutionen för datorteknik) ; T. Abdelzaher ; Jan Jonsson (Institutionen för datorteknik)
Proceedings. International Parallel and Distributed Processing Symposium, 2003 (1530-2075). (2003)
[Konferensbidrag, refereegranskat]

This paper studies multiprocessor scheduling for aperiodic tasks where future arrivals are unknown. A previously proposed priority-driven scheduling algorithm for periodic tasks with migration capability is extended to aperiodic scheduling and is shown to have a capacity bound of 0.5. This bound is close to the best achievable for a priority-driven scheduling algorithm. With an infinite number of processors, no priority-driven scheduling algorithm can perform better. We also propose a simple admission controller which guarantees that admitted tasks meet their deadlines and for many workloads, it admits tasks so that the utilization can be kept above the capacity bound.

Denna post skapades 2013-02-20.
CPL Pubid: 173901


Läs direkt!

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

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)



Chalmers infrastruktur