Abstract
The task of balancing dynamically generated work load occurs in a wide range of parallel and distributed applications. Diffusion based schemes, which belong to the class of nearest neighbor load balancing algorithms, are a popular way to address this problem. Originally created to equalize the amount of arbitrarily divisible load among the nodes of a static and homogeneous network, they have been generalized to heterogeneous topologies. Additionally, some simple diffusion algorithms have been adapted to work in dynamic networks as well. However, if the load is not divisible arbitrarily but consists of indivisible unit size tokens, diffusion schemes are not able to balance the load properly. In this paper we consider the problem of balancing indivisible unit size tokens on dynamic and heterogeneous systems. By modifying a randomized strategy invented for homogeneous systems, we can achieve an asymptotically minimal expected overload in l 1, l 2 and l ∞ norm while only slightly increasing the run-time by a logarithmic factor. Our experiments show that this additional factor is usually not required in applications.
This work was partly supported by the German Science Foundation (DFG) project SFB-376 and by the IST Program of the EU under contract numbers IST-1999-14186 (ALCOM-FT) and IST-2001-33116 (FLAGS).
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
Cybenko, G.: Load balancing for distributed memory multiprocessors. J. Par. Dist. Comp. 7, 279–301 (1989)
Muthukrishnan, S., Ghosh, B., Schultz, M.H.: First and second order diffusive methods for rapid, coarse, distributed load balancing. Theo. Comp. Syst. 31, 331–354 (1998)
Diekmann, R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing. Par. Comp. 25(7), 789–812 (1999)
Elsässer, R., Monien, B., Preis, R.: Diffusion schemes for load balancing on heterogeneous networks. Theo. Comp. Syst. 35, 305–320 (2002)
Sunderarm, V.S., Geist, G.A.: Heterogeneous parallel and distributed computing. Par. Comp. 25, 1699–1721 (1999)
Elsässer, R., Monien, B., Schamberger, S.: Load balancing in dynamic networks. In: I–SPAN (2004)
Rabbani, Y., Sinclair, A., Wanka, R.: Local divergence of markov chains and the analysis of iterative load-balancing schemes. In: FOCS, pp. 694–703 (1998)
Elsässer, R., Monien, B.: Load balancing of unit size tokens and expansion properties of graphs. In: SPAA, pp. 266–273 (2003)
Cortes, A., Ripoll, A., Cedo, F., Senar, M.A., Luque, E.: An asynchronous and iterative load balancing algorithm for discrete load model. J. Par. Dist. Comp. 62, 1729–1746 (2002)
Gehrke, J.E., Plaxton, C.G., Rajaraman, R.: Rapid convergence of a local load balancing algorithm for asynchronous rings. Theo. Comp. Sci. 220, 247–265 (1999)
Houle, M.E., Tempero, E., Turner, G.: Optimal dimension-exchange token distribution on complete binary trees. Theo. Comp. Sci. 220, 363–376 (1999)
Houle, M.E., Symvonis, A., Wood, D.R.: Dimension-exchange algorithms for load balancing on trees. In: Sirocco, pp. 181–196 (2002)
Ghosh, B., Leighton, F.T., Maggs, B.M., Muthukrishnan, S., Plaxton, C.G., Rajaraman, R., Richa, A., Tarjan, R.E., Zuckerman, D.: Tight analyses of two local load balancing algorithms. SIAM J. Computing 29, 29–64 (1999)
Cvetkovic, D.M., Doob, M., Sachs, H.: Spectra of Graphs, 3rd edn. Johann Ambrosius Barth (1995)
Ghosh, B., Muthukrishnan, S., Schultz, M.H.: First and second order diffusive methods for rapid, coarse, distributed load balancing. In: SPAA, pp. 72–81 (1996)
Fill, J.A.: Eigenvalue bounds on convergence to stationarity for nonreversible markov chains, with an application to the exclusion process. Ann. Appl. Probab. 1, 62–87 (1991)
Mihail, M.: Conductance and convergence of markov chains: a combinatorial treatment of expanders. In: FOCS, pp. 526–531 (1989)
Golub, G.: Bounds for the round-off errors in the richardson second order method. BIT 2, 212–223 (1962)
Hagerup, T., Rüb, C.: A guided tour of chernoff bounds. Inform. Proc. Letters 36(6), 305–308 (1990)
Sanders, P.: Analysis of nearest neighbor load balancing algorithms for random loads. Par. Comp. 25, 1013–1033 (1999)
Wang, Y., Li, X.-Y.: Geometric spanners for wireless ad hoc networks. In: ICDCS, pp. 171–180. IEEE, Los Alamitos (2002)
Johnson, D.B., Maltz, D.A.: Dynamic source routing in ad hoc wireless networks. In: Mobile Computing, vol. 353, Kluwer Academic Publishers, Dordrecht (1996)
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
Elsässer, R., Monien, B., Schamberger, S. (2004). Load Balancing of Indivisible Unit Size Tokens in Dynamic and Heterogeneous Networks. In: Albers, S., Radzik, T. (eds) Algorithms – ESA 2004. ESA 2004. Lecture Notes in Computer Science, vol 3221. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30140-0_57
Download citation
DOI: https://doi.org/10.1007/978-3-540-30140-0_57
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23025-0
Online ISBN: 978-3-540-30140-0
eBook Packages: Springer Book Archive