By Topic

An efficient greedy scheduling algorithm for join task graphs 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

3 Author(s)
Jianjun Zhang ; College of Science, Naval University of Engineering, 430033, Wuhan, Hubei Province, China ; Yexin Song ; Yong Qu

Many previous algorithms for scheduling task graphs are mainly for homogeneous processors and ignore the economization on processors in real applications, which leads to low efficiency in practice. In this paper we presents a new insertion based greedy algorithm, called the HGS_J algorithm for scheduling join task graphs in heterogeneous computing systems, which schedules tasks according to the critical task and tries to insert the tasks having the larger amounts of the total costs of computation and communication to used faster processors while guaranteeing shorter schedule length and so improves the scheduling performance. The simulation results show that the proposed algorithm has the characteristics of shorter schedule length and less number of used processors than other compared algorithms.

Published in:

World Automation Congress (WAC), 2012

Date of Conference:

24-28 June 2012