Login

Sporadic Multiprocessor Scheduling with Few Preemptions
Ref: HURRAY-TR-080402       Publication Date: 2 to 4, Jul, 2008

Sporadic Multiprocessor Scheduling with Few Preemptions

Ref: HURRAY-TR-080402       Publication Date: 2 to 4, Jul, 2008

Abstract:
Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).

Authors:
Björn Andersson
,
Konstantinos Bletsas


Euromicro Conference on Real-Time Systems (ECRTS '08), IEEE, pp 243-252.
Prague, Czech Republic.

DOI:10.1109/ECRTS.2008.9.
WOS ID: 000258259900023.

Notes: in , July 2008



Record Date: 17, Apr, 2008