By Topic

Load balancing algorithms for parallel database processing on shared memory multiprocessors

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

4 Author(s)
Y. Hirano ; NTT Network Inf. Syst. Lab., Kanagawa, Japan ; T. Satoh ; U. Inoue ; K. Teranaka

This paper describes new load balancing algorithms for parallel database processing on shared memory multiprocessors. The goal of load balancing is to reduce overhead as well as load imbalance, but there is a tradeoff between them in ordinary algorithms. Unfortunately, optimum performance can hardly be obtained using ordinary algorithms because their performances depend on several factors such as database size, the number of processors and data distribution. The proposed algorithms solve these problems by varying the number of tasks allocated at a time ( which was fixed in ordinary algorithms ) according to the number of remaining tasks and the maximum and minimum processing times of a task. Performance evaluations show that the proposed algorithms achieve fair load balancing with lower overhead independent of the above factors

Published in:

Parallel and Distributed Information Systems, 1991., Proceedings of the First International Conference on

Date of Conference:

4-6 Dec 1991