Multiprocessor Scheduling with Few Preemptions
Ref: HURRAY-TR-060811 Publication Date: 16 to 18, Aug, 2006
Multiprocessor Scheduling with Few PreemptionsRef: HURRAY-TR-060811 Publication Date: 16 to 18, Aug, 2006
Consider the problem of scheduling a set of periodically arriving tasks on a multiprocessor with the goal of meeting deadlines. Processors are identical and have the same speed. Tasks can be preempted and they can migrate between processors. We propose an algorithm with a utilization bound of 66% and with few preemptions. It can trade a higher utilization bound for more preemption and in doing so it has a utilization bound of 100%.
12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA'06), IEEE, pp 322-334.
Record Date: 1, Aug, 2006
Short links for this page: www.cister.isep.pt/docs/10_1109_rtcsa_2006_45 www.cister.isep.pt/docs/hurray_tr_060811 www.cister.isep.pt/docs/259