By Topic

A Low-Complexity Task Scheduling Algorithm for 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)
Foad Lotfifar ; Electron. Res. Center, Iran Univ. of Sci. & Technol., Tehran ; Hadi Shahriar Shahhoseini

Scheduling a parallel application on a set of processors is a well-known NP-complete problem. The problem becomes more complex when the base system is composed of heterogeneous processors. In this paper, we present a low-complexity task scheduling algorithm for heterogeneous computing systems, which we call the multiple critical path dominator (MCPD) algorithm. This algorithm is based on task duplication and its complexity is o(v2). An application for scheduling is represented by a directed acyclic graph (DAG). The MCPD algorithm employs a novel list scheduling algorithm for prioritizing tasks. This list-scheduling algorithm considers the variation of the critical paths in the DAG statistically whereby the MCPD algorithm attempts to schedule tasks on the processor according to the importance of the parent. We base our decisions on mean values of computation and communication cost of nodes and edges in the unscheduled DAG.

Published in:

2009 Third Asia International Conference on Modelling & Simulation

Date of Conference:

25-29 May 2009