Sporadic multiprocessor scheduling with few preemptions

Andersson, Björn; Bletsas, Konstantinos

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

Use this identifier to reference this record.

Name:	Description:	Size:	Format:
COM_BjornAndersson_2008_CISTER.pdf		334.76 KB	Adobe PDF	Download

Send Feedback

Authors

Andersson, Björn

Bletsas, Konstantinos

Abstract(s)

Consider the problem of scheduling n sporadic tasks so as to meet deadlines on m identical processors. A task is characterised by its minimum interarrival time and its worst-case execution time. Tasks are preemptible and may migrate between processors. We propose an algorithm with limited migration, configurable for a utilisation bound of 88% with few preemptions (and arbitrarily close to 100% with more preemptions).