Abstract
In this paper, we present a time dependent diffusion model for load balancing on synchronous networks with dynamically changing topology. This situation can arise for example from link failures. Our model is general and include Cybenko’s diffusion models for fixed topology networks. We will show that under some assumptions, the time dependent load balancing algorithm converges and balances the total work load among the processors in the distributed network.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
W. Aiello, T. Leighton: Coding theory, hypercube embeddings, and fault tolerance. 3rd Annual ACM Symposium on Parallel Algorithms and Architectures (1991) July.
G. Cybenko: Dynamic load balancing for distributed memory architecture. Journal of Parallel and Distributed Computing, 7, (1989), 279–301.
J. E. Boillat: Load balancing and poisson equation in a graph. Concurrency-Practice and Experiencen, 2, (1990), 289–313.
S.H. Hosseini, B. Litow, M. Malkawi, J. McPherson, K. Vairavan: Analysis of a graph coloring based distributed load balancing algorithm. Journal of Parallel and Distributed Computing, 10, (1990), 160–166.
W. Aiello, B. Awerbush, B. Maggs, S. Rao: Approximate load balancing on dynamic and asynchronous networks. Proc. of the 25th Annual ACM Symposium on on the Theory of Computing STOC (1993) May, 632–641.
A. Berman, R.J. Plemmons: Nonnegative matrices in the Mathematical sciences. Academic Press, New York (1979) reprinted by SIAM, Philadelphia, 1994.
B. Litow, S. H. Hosseini, K. Vairavan and G. S. Wolffe: Performance characteristics of a load balancing algorithm. Journal of Parallel and Distributed Computing, 31, (1995), 159–165.
F. T. Leighton, B. M. Maggs, R. K. Sitaraman: On the fault tolerance of some popular bounded-degree networks. SIAM Journal on computing (1998) October, 1303–1333.
R. Diekmanand, A. Frommer, B. Monien: Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25, (1999), 289–313.
M.-J. Bahi: Parallel chaotic algorithms for singular linear systems. Parallel algorithms and Applications, 14, (1999), 19–35.
M.-J. Bahi: Asynchronous iterative algorithms fo nonexpansive linear systems. Journal of Parallel and Distributed Computing, 60, (2000), 92–112.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bahi, J.M., Gaber, J. (2001). Load Balancing on Networks with Dynamically Changing Topology. In: Sakellariou, R., Gurd, J., Freeman, L., Keane, J. (eds) Euro-Par 2001 Parallel Processing. Euro-Par 2001. Lecture Notes in Computer Science, vol 2150. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44681-8_27
Download citation
DOI: https://doi.org/10.1007/3-540-44681-8_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-42495-6
Online ISBN: 978-3-540-44681-1
eBook Packages: Springer Book Archive