Scheduling Arbitrary-Deadline Sporadic Tasks on Multiprocessors
Ref: HURRAY-TR-080501 Publication Date: 30, Nov to 4, Dec, 2008
Scheduling Arbitrary-Deadline Sporadic Tasks on Multiprocessors
Ref: HURRAY-TR-080501 Publication Date: 30, Nov to 4, Dec, 2008Abstract:
Consider the problem of scheduling a set of n sporadic tasks to meet deadlines on m identical processors. A task is characterized by its minimum inter-arrival time, its deadline and its execution time. Tasks are preemptible and may migrate
between processors. We propose a scheduling algorithm for this problem. We also show (through simulation) experiments that for task sets that require pre-run-time guarantees that deadlines are met, the new algorithm offers a significant improvement on the ability to schedule arbitrary-deadline sporadic tasks as compared to the contemporary state-of-art.
Björn Andersson
Konstantinos Bletsas
Sanjoy BaruahDocument:
View
DownloadIEEE Real-Time Systems Symposium 2008, IEEE, pp 385-394.
Barcelona, Spain.
DOI:10.1109/RTSS.2008.44.
WOS ID: 000262709900035.
Record Date: 22, May, 2008
Short links for this page: www.cister-labs.pt/docs/10_1109_rtss_2008_44 www.cister-labs.pt/docs/000262709900035 www.cister-labs.pt/docs/hurray_tr_080501 www.cister-labs.pt/docs/406