Andersson, BjörnTovar, Eduardo2014-02-252014-02-2520060-7695-2676-41533-2306http://hdl.handle.net/10400.22/4037Consider 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%.engconference object10.1109/RTCSA.2006.45