By Topic

Two Hierarchical Dynamic Load Balancing Algorithms in Distributed 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

2 Author(s)
Barazandeh, I. ; Dept. of Comput. Eng., IAU, Mahshahr, Iran ; Mortazavi, S.S.

In this paper two new methods for load balancing in distributed systems are proposed. Both methods are based on hierarchical structure. Hierarchical structure provides better load management because it allows algorithms to balance the loads in two levels of groups and nodes. Since they have centralized load balancing mechanism, they have lower communication overheads too. These methods are dynamic and have simple implementation. The first method use biasing process to allocate weights called biases. Biases are determined based on the current load state of the groups and nodes. Second method improves round robin algorithm in a way that the group or node with minimum load state have priority on others to receive tasks from load balancers in a specific time slice. Comparative study of these methods is done for both homogeneous and heterogeneous nodes and it shows better performance than existing conventional algorithms.

Published in:

Computer and Electrical Engineering, 2009. ICCEE '09. Second International Conference on  (Volume:1 )

Date of Conference:

28-30 Dec. 2009