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, 2008Abstract:
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).
Björn Andersson
Konstantinos BletsasDocument:
View
DownloadEuromicro Conference on Real-Time Systems (ECRTS '08), IEEE, pp 243-252.
Prague, Czechia.
DOI:10.1109/ECRTS.2008.9.
WOS ID: 000258259900023.
Notes: in , July 2008
Record Date: 17, Apr, 2008
Short links for this page: www.cister-labs.pt/docs/10_1109_ecrts_2008_9_ www.cister-labs.pt/docs/000258259900023_ www.cister-labs.pt/docs/hurray_tr_080402 www.cister-labs.pt/docs/400