By Topic

A Multiple Priority Queueing Genetic Algorithm for Task Scheduling on 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
$31 $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

4 Author(s)
Yuming Xu ; Coll. of Inf. Sci. & Eng., Hunan Univ., Changsha, China ; Kenli Li ; Tung Truong Khac ; Meikang Qiu

On the distributed or parallel heterogeneous computing systems, an application is usually decomposed into several independent and/or interdependent sets of cooperating subtasks and assigned to a set of available processors for execution. Heuristic-based task scheduling algorithms consist of the two typical phases of task prioritization and processor selection. However, heuristic-based task scheduling algorithms produce a different makespan (completion time /schedule length) using the different task prioritization on a distributed or parallel heterogeneous computing systems. Therefore, the role of a good scheduling algorithm is to efficiently assign each subtask to a priority depending on the resources needed to minimize makespan. In this paper, a multiple priority queueing genetic algorithm (MPQGA) for task scheduling on heterogeneous computing systems is proposed. The basic idea of our approach is to exploit the advantages of both evolutionary and heuristic based algorithms while avoiding their drawbacks. Our algorithm incorporates a genetic algorithm (GA) approach to assign priority for each subtask while using a heuristic based heterogeneous earliest finish time (HEFT) approach to search for a solution for mapping subtasks to processors. The software simulation results, over a large set of randomly generated graphs as well as graphs for real-world problems with various characteristics, show that the makespan is increased when the number of nodes or communication to computation ratios (CCR) increased and decreased with the increasing parallelism or number of available processors. The proposed MPQGA algorithm significantly outperforms several related algorithms in terms of the schedule quality. The average makespan reduction is about 5.3%.

Published in:

High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems (HPCC-ICESS), 2012 IEEE 14th International Conference on

Date of Conference:

25-27 June 2012