List scheduling with duplication for heterogeneous computing systems

  • Authors:

  • Xiaoyong Tang;Kenli Li;Guiping Liao;Renfa Li

  • Affiliations:

  • School of Computer and Communication, Hunan University, Changsha, 410082, China and Information Science and Technology College, Hunan Agricultural University, Changsha, 410128, China;School of Computer and Communication, Hunan University, Changsha, 410082, China;Information Science and Technology College, Hunan Agricultural University, Changsha, 410128, China;School of Computer and Communication, Hunan University, Changsha, 410082, China

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

Effective task scheduling is essential for obtaining high performance in heterogeneous computing systems (HCS). However, finding an effective task schedule in HCS, requires the consideration of the heterogeneity of computation and communication. To solve this problem, we present a list scheduling algorithm, called Heterogeneous Earliest Finish with Duplicator (HEFD). As task priority is a key attribute for list scheduling algorithm, this paper presents a new approach for computing their priority which considers the performance difference in target HCS using variance. Another novel idea proposed in this paper is to try to duplicate all parent tasks and get an optimal scheduling solution. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithm HEFD significantly surpasses other three well-known algorithms.