Competitive analysis of partitioned scheduling on uniform multiprocessors

Andersson, Björn; Tovar, Eduardo

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
ART_BAndersson_2007_CISTER.pdf		205.18 KB	Adobe PDF	Download

Send Feedback

Authors

Andersson, Björn

Tovar, Eduardo

Abstract(s)

Consider the problem of scheduling a set of sporadically arriving tasks on a uniform multiprocessor with the goal of meeting deadlines. A processor p has the speed Sp. Tasks can be preempted but they cannot migrate between processors. We propose an algorithm which can schedule all task sets that any other possible algorithm can schedule assuming that our algorithm is given processors that are three times faster.