By Topic

An approach to compile-time task scheduling in heterogeneous computing systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
T. Hagras ; Czech Technical University in Prague ; J. Janecek

List-based scheduling is generally accepted as an attractive approach to static task scheduling since it combines low complexity with good results. Although a large number of scheduling heuristics have been presented in the literature, most of them target only homogeneous computing systems and almost none of them target heterogeneous communication systems. In this paper we present a simple scheduling algorithm based on list-scheduling and task-duplication on a bounded number of heterogeneous machines called Heterogenous Critical Nodes with Fast Duplicator (HCNFD). The suggested algorithm supports both heterogeneous computation and communication environments. The analysis and experiments have shown that HCNFD outperforms on average all other higher complexity algorithms.

Published in:

Parallel Processing Workshops, 2004. ICPP 2004 Workshops. Proceedings. 2004 International Conference on

Date of Conference:

18-18 Aug. 2004