Abstract
Nearest-neighbor load balancing algorithms have emerged as one of the most important techniques for parallel computers based on direct networks. This chapter classifies the nearest-neighbor algorithms by their distribution rules and surveys related works in the literature.
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). A Survey of Nearest-Neighbor Load Balancing Algorithms. 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_2
Download citation
DOI: https://doi.org/10.1007/978-0-585-27256-6_2
Publisher Name: Springer, Boston, MA
Print ISBN: 978-0-7923-9819-6
Online ISBN: 978-0-585-27256-6
eBook Packages: Springer Book Archive