Advertisement

Deterministic Random Walks on the Two-Dimensional Grid

  • Benjamin Doerr
  • Tobias Friedrich
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4288)

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.

Keywords

Random Walk Mathematical Intelligencer Unimodal Function Simple Random Walk Rotor Sequence 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    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)CrossRefGoogle Scholar
  2. 2.
    Cooper, J., Spencer, J.: Simulating a random walk with constant error. Combinatorics, Probability and Computing (also available at arXiv:math.CO/0402323)Google Scholar
  3. 3.
    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)Google Scholar
  4. 4.
    Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7(2), 279–301 (1989)CrossRefGoogle Scholar
  5. 5.
    Kleber, M.: Goldbug Variations. The Mathematical Intelligencer 27(1) (2005)Google Scholar
  6. 6.
    Levine, L., Peres, Y.: The rotor-router shape is spherical. The Mathematical Intelligencer 27(3), 9–11 (2005)MATHCrossRefGoogle Scholar
  7. 7.
    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)Google Scholar
  8. 8.
    Subramanian, R., Scherson, I.D.: An analysis of diffusive load-balancing. In: SPAA, pp. 220–225. ACM Press, New York (1994)Google Scholar
  9. 9.
    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)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Benjamin Doerr
    • 1
  • Tobias Friedrich
    • 1
  1. 1.Max-Planck-Institut für InformatikSaarbrückenGermany

Personalised recommendations