Advertisement

The Effect of Forgetting on the Performance of a Synchronizer

  • Matthias Függer
  • Alexander KößlerEmail author
  • Thomas Nowak
  • Ulrich Schmid
  • Martin Zeiner
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8243)

Abstract

We study variants of the \(\alpha \)-synchronizer by Awerbuch (J. ACM, 1985) within a distributed message passing system with probabilistic message loss. The purpose of synchronizers is to maintain a virtual (discrete) round structure. Their idea essentially is to let processes continuously exchange round numbers and to allow a process to proceed to the next round only after it has witnessed that all processes have already started its own current round.

In this work, we study how four different, naturally chosen, strategies of forgetting affect the performance of these synchronizers. The variants differ in the times when processes discard part of their accumulated knowledge during execution. Such actively forgetting synchronizers have applications, e.g., in sensor fusion where sensor data becomes outdated and thus invalid after a certain amount of time.

We give analytical formulas to quantify the degradation of the synchronizers’ performance in an environment with probabilistic message loss. In particular, the formulas allow to explicitly calculate the performance’s asymptotic behavior. Interestingly, all considered synchronizer variants behave similarly in systems with low message loss, while one variant shows fundamentally different behavior from the remaining three in systems with high message loss. The theoretical results are backed up by Monte-Carlo simulations.

Keywords

Markov Chain Model Steady State Distribution Round Number Current Round Message Loss 
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.

References

  1. 1.
    Awerbuch, B.: Complexity of network synchronization. J. ACM 32, 804–823 (1985)CrossRefzbMATHMathSciNetGoogle Scholar
  2. 2.
    Bertsekas, D.P., Tsitsiklis, J.N.: Parallel and Distributed Computation: Numerical Methods. Prentice Hall, Englewood Cliffs (1989)zbMATHGoogle Scholar
  3. 3.
    Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning About Knowledge. MIT Press, Cambridge (1995)zbMATHGoogle Scholar
  4. 4.
    Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics. Addison-Wesley, Reading (1989)zbMATHGoogle Scholar
  5. 5.
    Jayaram, M., Varghese, G.: Crash failures can drive protocols to arbitrary states. 15th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 247–256. ACM, New York (1996)Google Scholar
  6. 6.
    Kirschenhofer, P., Prodinger, H.: A result in order statistics related to probabilistic counting. Computing 51(1), 15–27 (1993)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    Marzullo, K.A.: Tolerating failures of continuous-valued sensors. ACM Trans. on Comput. Syst. 8(4), 284–304 (1990)CrossRefGoogle Scholar
  8. 8.
    Meyn, S., Tweedie, R.L.: Markov Chains and Stochastic Stability. Springer, Heidelberg (1993)CrossRefzbMATHGoogle Scholar
  9. 9.
    Nakamura, E.F., Loureiro, A.A.F., Frery, A.C.: Information fusion for wireless sensor networks: methods, models, and classifications. ACM Comput. Surv. 39(3), 9 (2007). doi: 10.1145/1267070.1267073 CrossRefGoogle Scholar
  10. 10.
    Nowak, T., Függer, M., Kößler, A.: On the Performance of a Retransmission-Based Synchronizer. Theor. Comput. Sci. (2012). doi: 10.1016/j.tcs.2012.04.035
  11. 11.
    Rajsbaum, S.: Upper and lower bounds for stochastic marked graphs. Inform. Process. Lett. 49, 291–295 (1994)CrossRefzbMATHMathSciNetGoogle Scholar
  12. 12.
    Rajsbaum, S., Sidi, M.: On the performance of synchronized programs in distributed networks with random processing times and transmission delays. IEEE Trans. Parall. Distr. 5, 939–950 (1994)CrossRefGoogle Scholar
  13. 13.
    Schmid, U., Schossmaier, K.: How to reconcile fault-tolerant interval intersection with the Lipschitz condition. Distrib Comp. 14(2), 101–111 (2001)CrossRefGoogle Scholar
  14. 14.
    Szpankowski, W., Rego, V.: Yet another application of a binomial recurrence order statistics. Computing 43(4), 401–410 (1990)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Matthias Függer
    • 1
  • Alexander Kößler
    • 1
    Email author
  • Thomas Nowak
    • 2
  • Ulrich Schmid
    • 1
  • Martin Zeiner
    • 1
  1. 1.ECS GroupTU WienViennaAustria
  2. 2.Laboratoire d’InformatiqueÉcole polytechniquePalaiseauFrance

Personalised recommendations