By Topic

A genetic exploration of dynamic load balancing algorithms

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)
M. Aldasht ; Dept. of Comput. Archit. & Technol., Granada Univ., Spain ; J. Ortega ; C. G. Puntonet ; A. F. Diaz

Evolutionary algorithms provide ways to explore wide search spaces. Thus, it is possible to get some conclusions about the characteristics of these spaces in order to aid in the determination of the best alternatives to solve the problem at hand. We have applied a genetic algorithm to assess the problem of distributed load balancing in parallel processing. To do that, we propose a classification of the space of design of distributed load balancing algorithms that takes into account the different alternatives for each dimension of the algorithm. This classification allows the codification of each load balancing strategy, thus making possible to apply a genetic search to determine the distributed load balancing procedure that provides the best performance for the type of parallel application at hand and the parallel platform where it is implemented. As an example, in this paper we provide the results corresponding to the parallel multiplication of matrices implemented in a cluster.

Published in:

Evolutionary Computation, 2004. CEC2004. Congress on  (Volume:1 )

Date of Conference:

19-23 June 2004