By Topic

Scalability of a load balancing algorithm, and its implementation on an Intel Paragon

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)
Boukerche, A. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Das, S.K.

This paper describes an efficient implementation of a load balancing algorithm based upon a process migration mechanism, and the notion of CPU-queue length which indicates the workload at each processor. The main objective is to reduce the message overhead in conservative simulation. The algorithms were tested on four simulation workload models to study the the scalability of our algorithm on an Intel Paragon multicomputer architecture using 64 processors. A significant decrease in run time and the message overhead associated with the conservative simulation was obtained with the use of the proposed dynamic load balancing algorithm as compared to the use of a static partitioning algorithm

Published in:

Parallel Architectures, Algorithms, and Networks, 1999. (I-SPAN '99) Proceedings. Fourth InternationalSymposium on

Date of Conference:

1999