By Topic

Neighbor's load prediction for dynamic load balancing in a distributed computational environment

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)
Jay W. Y. Lim ; Fac. of Comput. & Inf., Multimedia Univ., Cyberjaya, Malaysia ; Poo Kuan Hoong ; Eng-Thiam Yeoh

In distributed computing environment, divisible load technique is used to speedup the completion time of a parallel task by splitting a huge task into a smaller grain size jobs where jobs can be executed remotely by other nodes. Due to the heterogeneity of computing nodes, load balancing technique is employed to distribute workload evenly across distributed nodes in order to reduce the overall response time and maximize the resource utilization. Load information plays an important role in heterogeneous computing environment to formulate a job distribution decision. In this paper, we propose a dynamic load balancing algorithm where its information policy for those nodes that have an empty neighbors' list to discover and predict other neighbors' load information. Simulation results from various scenarios show that our approach able to reduce the overall average response time of each job.

Published in:

TENCON 2012 - 2012 IEEE Region 10 Conference

Date of Conference:

19-22 Nov. 2012