By Topic

Two new biasing 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
$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)
Iman Barazandeh ; Dept. of Computer Engineering, IAU, Sciences and Researches, Ahwaz, Iran ; S. S. Mortazavi ; A. M. Rahmani

In this paper two new methods for load balancing in distributed systems are proposed. Both methods are based on hierarchical structure. These methods have two major advantages of static and dynamic methods: the simplicity of static methods and adaptiveness of dynamic methods. They use current state information of nodes for the decision making in workloads allocations on the excising nodes in distributed systems. The first method determines specific weights, called biases, on groups and nodes, based on the state information of the system. The second method called Minimum Load State Round Robin (MLSRR), uses state information of the system to improve common round robin method. Comparative study of these methods shows better performance than existing conventional algorithms.

Published in:

2009 First Asian Himalayas International Conference on Internet

Date of Conference:

3-5 Nov. 2009