Multiprocessor Real-Time Scheduling with a Few Migrating Tasks

Download Now
Provided by: Institute of Electrical & Electronic Engineers
Topic: Hardware
Format: PDF
Algorithms for scheduling n sporadic tasks on m identical processors to meet deadlines were traditionally classified as partitioning or global scheduling. Partitioning divides the task set into disjoint subsets; each subset is assigned to a respective processor and scheduled by some uniprocessor algorithm such as Earliest-Deadline-First (EDF) and Fixed Priority Scheduling (FPS). Global scheduling maintains a single run queue for all tasks and, at any given instant, the m highest priority tasks execute, each on one of the m processors.
Download Now

Find By Topic