Semi-Partitioned Scheduling of Sporadic Task Systems on Multiprocessors

Download Now
Provided by: University of Tokushima
Topic: Hardware
Format: PDF
In this paper, the authors present a new algorithm for scheduling of sporadic task systems with arbitrary deadlines on identical multiprocessor platforms. The algorithm is based on the concept of semi-partitioned scheduling, in which most tasks are fixed to specific processors, while a few tasks migrate across processors. Particularly, they design the algorithm so that tasks are qualified to migrate only if a task set cannot be partitioned any more, and such migratory tasks migrate from one processor to another processor only once in each period.
Download Now

Find By Topic