By Topic

A new heuristic algorithm based on GAs for multiprocessor scheduling with task duplication

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)
Tsuchiya, T. ; Dept. of Inf. & Math. Sci., Osaka Univ., Japan ; Osada, T. ; Kikuno, T.

In this paper, we propose a new algorithm for scheduling parallel programs represented as directed acyclic graphs onto multiprocessors with communication delays. In such systems, task duplication is known as a useful technique for shortening the length of schedules. The proposed algorithm adopts several heuristics based on GAs as well as task duplication. To apply a GA to scheduling, we design chromosomes using list representation so that each chromosome can uniquely represent a schedule of tasks. We also design genetic operators to control the degree of replication of tasks. Through simulation studies for three kinds of parallel programs under various scheduling conditions, we compare the proposed algorithm with an established algorithm proposed by Kruatrachue. As a result, it is found that the new heuristic algorithm outperforms the previous algorithm especially when communication delays are relatively small

Published in:

Algorithms and Architectures for Parallel Processing, 1997. ICAPP 97., 1997 3rd International Conference on

Date of Conference:

10-12 Dec 1997