Abstract
In this paper, an adaptation of the first order diffusive scheme to dynamic networks and its accelerated version with an optimal relaxation parameter are given. A network with dynamic links assumes that edges of the network topology may be unpredictably broken down. Contrary to the static network framework, the connection graphs of the dynamic network may be always not connected. Various simulations on static and dynamic networks confirm our theoretical results.
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.
References
Hosseini, S.H., Litow, B., Malkawi, M., McPherson, J., Vairavan, K.: Analysis of a Graph Coloring Based Distributed Load Balancing Algorithm. Jou. of Para. and Dist. Comp. 10, 160–166 (1990)
Cybenko, G.: Dynamic Load Balancing for Distributed Memory Multiprocessors. Jou. of Para. and Dist. Comp. 7, 279–301 (1989)
Bahi, J.M., Gaber, J.: Load Balancing on Networks with Dynamically Changing Topology. In: Europar Conf. LNCS, pp. 175–182 (2001)
Bahi, J.M., Couturier, R., Vernier, F.: Broken Edges and Dimension Exchange Algorithm on Hypercube Topology. In: Euromicro Conf. PDP, pp. 140–145 (2003)
Leighton, F.T., Maggs, B.M., Sitaraman, R.K.: On the Fault Tolerance of Some Popular Bounded-Degree Networks. SIAM Jou. on Comp. 27, 1303–1333 (1998)
Berman, A., Plemmons, R.J.: Nonnegative Matrices in the Mathematical Sciences, 3rd edn. SIAM, Philadelphia (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bahi, J., Couturier, R., Vernier, F. (2004). Accelerated Diffusion Algorithms on General Dynamic Networks. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Waśniewski, J. (eds) Parallel Processing and Applied Mathematics. PPAM 2003. Lecture Notes in Computer Science, vol 3019. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24669-5_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-24669-5_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-21946-0
Online ISBN: 978-3-540-24669-5
eBook Packages: Springer Book Archive