Abstract
We have examined a class of nearest-neighbor algorithms for load balancing in distributed memory parallel computers. The focus has been on two closely related methods: the dimension exchange method and the diffusion method. They are very simple algorithmically but turn out to be quite effective when applied to parallel computers.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1997 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1997). Conclusions. In: Load Balancing in Parallel Computers. The Springer International Series in Engineering and Computer Science, vol 381. Springer, Boston, MA. https://doi.org/10.1007/978-0-585-27256-6_10
Download citation
DOI: https://doi.org/10.1007/978-0-585-27256-6_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9819-6
Online ISBN: 978-0-585-27256-6
eBook Packages: Springer Book Archive