Abstract
This paper describes a new load balancing algorithm, the probabilistic strategy with neighbourhood synchronization (PNS), for massively parallel computers. The proposed strategy differs from fully distributed approaches which require a high interprocessor communication overhead when the number of processors becomes large. This load balancing strategy uses only local information and takes into account the information lags in distributed systems for estimating the system load.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
T.L. Casavant and J.G. Kuhl, “A Taxonomy of Scheduling in General-Purpose Distributed Computing Systems,” IEEE Transactions on Software Engineering, vol. SE-14, no. 2, pp. 141–154, Feb. 1988.
M. Cannataro, Ya. D. Sergeyev, G. Spezzano, and D. Talia, “Probabilistic Load Balancing Strategy with the Neighbourhood Synchronization”, Technical Report, CRAI.no. 92-03, Feb. 1992.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cannataro, M., Sergeyev, Y.D., Spezzano, G., Talia, D. (1993). A dynamic load balancing strategy for massively parallel computers. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_54
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_54
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive