Notional processors: an approach for multiprocessor scheduling
Ref: HURRAY-TR-090101 Publication Date: 13 to 16, Apr, 2009
Notional processors: an approach for multiprocessor schedulingRef: HURRAY-TR-090101 Publication Date: 13 to 16, Apr, 2009
Consider the problem of designing an algorithm with a high utilisation bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterised by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable. We formulate an algorithm with a utilisation bound no less than 66.¯6%, characterised by worst-case preemption counts comparing favorably against the state-of-the-art.
15th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2009), IEEE, pp 3-12.
San Francisco, U.S.A..
WOS ID: 000266729200001.
Record Date: 25, Jan, 2009
Short links for this page: www.cister.isep.pt/docs/10_1109_rtas_2009_25 www.cister.isep.pt/docs/000266729200001_ www.cister.isep.pt/docs/hurray_tr_090101 www.cister.isep.pt/docs/438