Abstract
Deterministic and randomized balancing schemes are used to distribute workload evenly in networks. In this paper, we compare two very general ones: The random walk and the (deterministic) Propp machine. Roughly speaking, we show that on the two-dimensional grid, the Propp machine always has the same number of tokens on a node as does the random walk in expectation, apart from an additive error of less than eight. This constant is independent of the total number of tokens and the runtime of the two processes. However, we also show that it makes a difference whether the Propp machine serves the neighbors in a circular or non-circular order.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Collins, G.E., Akritas, A.G.: Polynomial real root isolation using descarte’s rule of signs. In: SYMSAC 1976: Proceedings of the third ACM symposium on Symbolic and algebraic computation, pp. 272–275. ACM Press, New York (1976)
Cooper, J., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability and Computing (also available at arXiv:math.CO/0402323)
Cooper, J., Doerr, B., Spencer, J., Tardos, G.: Deterministic random walks. In: ANALCO 2006: Proceedings of the Workshop on Analytic Algorithmics and Combinatorics, pp. 185–197. SIAM, Philadelphia (2006)
Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7(2), 279–301 (1989)
Kleber, M.: Goldbug Variations. The Mathematical Intelligencer 27(1) (2005)
Levine, L., Peres, Y.: The rotor-router shape is spherical. The Mathematical Intelligencer 27(3), 9–11 (2005)
Rabani, Y., Sinclair, A., Wanka, R.: Local divergence of markov chains and the analysis of iterative load-balancing schemes. In: FOCS 1998: Proceedings of the 39th Annual Symposium on Foundations of Computer Science, pp. 694–705. IEEE Computer Society Press, Los Alamitos (1998)
Subramanian, R., Scherson, I.D.: An analysis of diffusive load-balancing. In: SPAA, pp. 220–225. ACM Press, New York (1994)
Xu, C.-Z., Monien, B., Lüling, R., Lau, F.C.M.: An analytical comparison of nearest neighbor algorithms for load balancing in parallel computers. In: IPPS, pp. 472–479. IEEE Computer Society Press, Los Alamitos (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doerr, B., Friedrich, T. (2006). Deterministic Random Walks on the Two-Dimensional Grid. In: Asano, T. (eds) Algorithms and Computation. ISAAC 2006. Lecture Notes in Computer Science, vol 4288. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11940128_48
Download citation
DOI: https://doi.org/10.1007/11940128_48
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-49694-6
Online ISBN: 978-3-540-49696-0
eBook Packages: Computer ScienceComputer Science (R0)