Abstract
The token distribution (TD) problem, an abstract static variant of load balancing, is defined as follows: let M be a (parallel processor) network with processors \(\mathcal{P}\). Initially each processor P ∃ \(\mathcal{P}\) has a certain amount ℓ(P) of tokens. The goal of a TD algorithm, run on M, is to evenly distribute the tokens among the processors. In this paper, we introduce TD algorithms that are strongly adaptive, i. e. whose running times come close to the best possible runtime, the off-line complexity of the TD problem, for each individual initial token distribution ℓ. Until now, only weakly adaptive algorithms have been considered, where the running time is measured in terms of the maximum initial load max{ℓ(P) ¦ P ε \(\mathcal{P}\)}.
We design an almost optimal, strongly adaptive algorithm on mesh-connected networks of arbitrary dimension. Furthermore, we exactly characterize the off-line complexity of arbitrary initial token distributions on arbitrary networks. As an intermediate result, we design almost optimal weakly adaptive algorithms for TD on mesh-connected networks of arbitrary dimension.
partially supported by DFG-Forschergruppe “Effiziente Nutzung massiv paralleler Systeme, Teilprojekt 4”, by the Esprit Basic Research Action No. 7141 (ALCOM II), and by the Volkswagenstiftung.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
A. Z. Broder, A. M. Frieze, E. Shamir, and E. Upfal Near-perfect token distribution. In Proceedings of the 19th ICALP, pages 308–317, 1992.
K. T. Herley. A note on the token distribution problem. Inf. Process. Lett., 38:329–334, 1991.
J. JáJá and K. W. Ryu. Load balancing and routing on the hypercube and related networks. Journal of Parallel and Distributed Computing, 14:431–435, 1992.
F. T. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
F. Makedon and A. Symvonis. Optimal algorithms for the many-to-one routing problem on 2-dimensional meshes. Microprocessors and Microsystems, 1993, to appear.
B. Oesterdiekhoff. Entwurf und Analyse adaptiver Lastbalancierungsverfahren. Diplomarbeit, Universität-GH Paderborn, Dez. 1992 (In German).
D. Peleg and E. Upfal. The generalized packet routing problem. Theoretical Comput. Sci., 53:281–293, 1987.
D. Peleg and E. Upfal. The token distribution problem. SIAM J. Comput., 18:229–243, 1989.
C. G. Plaxton. Load balancing, selection and sorting on the hypercube. In Proceedings of the ACM-SPAA, pages 64–73, 1989.
R. E. Tarjan. Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia, PA, 1983.
R. Werchner. Balancieren und Selection auf Expandern und auf dem Hyperwürfel. Diplomarbeit, J.W.Goethe-Universität, Frankfurt, Jan. 1991 (In German).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Meyer auf der Heide, F., Oesterdiekhoff, B., Wanka, R. (1993). Strongly adaptive token distribution. In: Lingas, A., Karlsson, R., Carlsson, S. (eds) Automata, Languages and Programming. ICALP 1993. Lecture Notes in Computer Science, vol 700. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56939-1_89
Download citation
DOI: https://doi.org/10.1007/3-540-56939-1_89
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56939-8
Online ISBN: 978-3-540-47826-3
eBook Packages: Springer Book Archive