A simple scheduling heuristic for heterogeneous computing environments

  • Authors:
  • Tarek Hagras;Jan Janecek

  • Affiliations:
  • Czech Technical University in Prague, Dept. of Computer Science and Engineering;Czech Technical University in Prague, Dept. of Computer Science and Engineering

  • Venue:
  • ISPDC'03 Proceedings of the Second international conference on Parallel and distributed computing
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

Efficient task scheduling of computationally intensive applications is one of the most essential and difficult issues when aiming at high performance in heterogeneous computing environments. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous computing systems. In this paper we present a simple list-scheduling heuristic for a bounded number of heterogeneous machines called Heterogenous Critical Parent Trees (HCPT). The analysis and experiments have shown that HCPT provides comparable or even better results together with low complexity.