Andersson, BjörnBletsas, Konstantinos2014-02-182014-02-182008978-0-7695-3298-11068-3070http://hdl.handle.net/10400.22/3936Consider 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).engconference object