By Topic

An improved genetic algorithm for load balance in multiprocessor 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

4 Author(s)
Bin Jiang ; Embedded Systems & Networking Laboratory, HUNAN UNIVERSITY, China ; Rui Li ; Renfa Li ; Demin Han

The allocating and scheduling of tasks in parallel and distributed systems has been considered to be an NP-Complete problem, which has received much attention. Although plentiful algorithms have been developed to obtain suboptimal solutions, many of them didn't consider the total execution time and load balancing among processors simultaneously. To solve this problem efficiently, this paper presents an improved genetic algorithm based on the Critical Path Genetic Algorithm (CPGA) with some heuristic principles added to improve the performance. According to the evaluation results, our proposed algorithm could ensure the quality and efficiency of obtained solutions while avoiding the issues of CPGA algorithm, and always outperforms the CPGA algorithm in the respect of load balancing.

Published in:

Advanced Communication Technology (ICACT), 2012 14th International Conference on

Date of Conference:

19-22 Feb. 2012