By Topic

Load Balancing Algorithms with Partial Information Management for the DLML Library

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

4 Author(s)
Santana-Santana, J. ; Dept. de Ing. Electr., Univ. Autonoma Metropolitana, Mexico City, Mexico ; Castro-Garcia, M.A. ; Aguilar-Cornejo, M. ; Roman-Alonso, G.

Load balancing algorithms are an essential component of parallel computing reducing the response time of applications. Frequently, balancing algorithms have a centralized behavior requiring a lot of messages to operate, thus causing scalability problems. A solution to improve scalability is to define a decentralized algorithm, avoiding the generation of bottlenecks. DLML (Data List Management Library) is a tool that, in a transparent way, allows the parallel processing of data that are organized through a List. One drawback of this tool is the global bidding algorithm used to distribute the data (work) generated during the execution. In this paper two load balancing algorithms for DLML handling partial information are proposed. The first algorithm considers a logical Torus topology and the second one follows a Binary Tree topology for communications. Results show how the scalability of DLML was improved, using two clusters of 40 and 1024 processing units, and executing dynamic and static applications.

Published in:

Parallel, Distributed and Network-Based Processing (PDP), 2010 18th Euromicro International Conference on

Date of Conference:

17-19 Feb. 2010