Link contention-constrained scheduling and mapping of tasks

  • Authors:

  • Yu-Kwong Kwok;Ishfaq Ahmad

  • Affiliations:

  • Department of Electrical and Electronic Engineering, The University of Hong Kong, Pokfulam Road, Hong Kong;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong

  • Venue:
  • Cluster Computing
  • Year:
  • 2000

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we consider the problem of scheduling and mapping precedence‐constrained tasks to a network of heterogeneous processors. In such systems, processors are usually physically distributed, implying that the communication cost is considerably higher than in tightly coupled multiprocessors. Therefore, scheduling and mapping algorithms for such systems must schedule the tasks as well as the communication traffic by treating both the processors and communication links as equally important resources. We propose an algorithm that achieves these objectives and adapts its task scheduling and mapping decisions according to the given network topology. Just like tasks, messages are also scheduled and mapped to suitable links during the minimization of the finish times of tasks. Heterogeneity of processors is exploited by scheduling critical tasks to the fastest processors. Our experimental study has demonstrated that the proposed algorithm is efficient and robust, and yields consistent performance over a wide range of scheduling parameters.