By Topic

A new nature-inspired algorithm for load balancing

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)
Xiang Feng ; Department of Computer Science, East China University of Science and Technology, Shanghai, China 200237 ; Francis C. M. Lau ; Dianxun Shuai

The classical Load Balancing Problem (LBP) is to map tasks to processors so as to minimize the maximum load. Solving the LBP successfully would lead to better utilization of resources and better performance. The LBP has been proven to be NP-hard, thus generating the exact solutions in a tractable amount of time becomes infeasible when the problems become large.We present a new nature-inspired approximation algorithm based on the Particle Mechanics (PM) model to compute in parallel approximate efficient solutions for LBPs. Just like other Nature-inspired Algorithms (NAs) drawing from observations of physical processes that occur in nature, the PM algorithm is inspired by physical models of particle kinematics and dynamics. The PM algorithm maps the classical LBP to the movement of particles in a force field by a corresponding mathematical model in which all particles move according to certain defined rules until reaching a stable state. By anti-mapping the stable state, the solution to LBP can be obtained.

Published in:

Communication Systems, 2008. ICCS 2008. 11th IEEE Singapore International Conference on

Date of Conference:

19-21 Nov. 2008