Performance implications of task routing and task scheduling strategies for multiprocessor systems

In distributed task ready queue organizations, task routing refers to how ready tasks are assigned to processors in the system and task scheduling refers to how these tasks are scheduled on the assigned processor. In this paper, we consider the interaction between task routing and task scheduling strategies and their impact on the performance of the distributed task queue organization. We consider four task routing strategies two adaptive and two non-adaptive-and five task scheduling policies-two preemptive and three run-to-completion policies. We show that, when adaptive task routing is employed, the scheduling policy has only a marginal impact on performance and preemptive round robin policies tend to perform worse than the FCFS policy.<>