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

Partitioned 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. We propose an algorithm for tasks without migration capabilities and prove that it has a capacity bound of 0.31. No algorithm for tasks without migration capabilities can have a capacity bound greater than 0.50.

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


Läs direkt!

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

Institutioner (Chalmers)

Institutionen för datorteknik (2002-2004)



Chalmers infrastruktur