Notional Processors: An Approach for Multiprocessor Scheduling

Consider the problem of designing an algorithm with a high utilization bound for scheduling sporadic tasks with implicit deadlines on identical processors. A task is characterized by its minimum interarrival time and its execution time. Task preemption and migration is permitted. Still, low preemption and migration counts are desirable.We formulate an algorithm with a utilization bound no less than 66.6%characterized by worst-case preemption counts comparing favorably against the state-of-the-art.