Cart (Loading....) | Create Account
Close category search window

A Distributed Load Balancing Scheme for Data Parallel Applications

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)
Tout, Walid R. ; Michigan State University ; Pramanik, S.

In data parallel applications, a major source of load trnbalance is in the uneven didribtitton of data between the nodes. The majar contribution of this paper is the analysis o j a new distributed Ioad balancing scheme based on random probing. Sequential probing was shown to create hot spot problems. Random probing, on the other hand, avoids these hot spots problems. We hove modeled this load balancing scheme bath anaiytically and experimentally. Distributed Hash Joan was used as an example application. The experimenls were done on a BEN TC2OOO rnulttprocessov- system.

Published in:

Parallel Processing, 1993. ICPP 1993. International Conference on  (Volume:2 )

Date of Conference:

16-20 Aug. 1993

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.