Multiprocessor scheduling with few preemptions

Andersson, Björn; Tovar, Eduardo

http://hdl.handle.net/10400.22/4037

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
COM_BAndersson_2006_CISTER.pdf		176.6 KB	Adobe PDF	Download

Send Feedback

Authors

Andersson, Björn

Tovar, Eduardo

Abstract(s)

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%.