Fixed-priority preemptive multiprocessor scheduling: To partition or not to partition

Traditional multiprocessor real-time scheduling partitions a task set and applies uniprocessor scheduling on each processor: By allowing a task to resume on another processor than the task was preempted an, some task sets can be scheduled where the partitioned method fails. we address fixed-priority preemptive scheduling of periodically arriving tasks on m equally powerful processors. I Ye compare the performance of the best algorithms of the partitioned and non-partitioned method, fr om two different aspects. First, an average-case comparison, using an idealized architecture, shows that, ifa system has a small number of processors, then the non-partitioned method offers higher performance than the partitioned method. Second, ail average-case comparison, using a realistic architecture, shows that, for several combinations of preemption and migration costs, the non-partitioned method offers higher performance.