Distributed Computing

, Volume 18, Issue 3, pp 179–188 | Cite as

Efficient adaptive collect using randomization

  • Hagit Attiya
  • Fabian Kuhn
  • C. Greg Plaxton
  • Mirjam Wattenhofer
  • Roger Wattenhofer
Special Issue: Disc 04

Abstract

An adaptive algorithm, whose step complexity adjusts to the number of active processes, is attractive for distributed systems with a highly-variable number of processes. The cornerstone of many adaptive algorithms is an adaptive mechanism to collect up-to-date information from all participating processes. To date, all known collect algorithms either have non-linear step complexity or they are impractical because of unrealistic memory overhead.

This paper presents new randomized collect algorithms with asymptotically optimal O(k) step complexity and linear memory overhead only. In addition we present a new deterministic collect algorithm that beats the best step complexity for previous polynomial-memory algorithms.

Keywords

Adaptive algorithms Total contention Randomization 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Afek, Y., Merritt, M.: Fast, wait-free (2k−1)-renaming. In: Proceedings of the 18th Annual ACM Symposium on Principles of Distributed Computing, pp. 105--112 (1999)Google Scholar
  2. 2.
    Afek, Y., Strupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pp. 262--272 (1999)Google Scholar
  3. 3.
    Afek, Y., Stupp, G., Touitou, D.: Long-lived and adaptive atomic snap-shot and immediate snapshot. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 71--80 (2000)Google Scholar
  4. 4.
    Afek, Y., Stupp, G., Touitou., D.: Long lived adaptive splitter and applications. Distributed Computing 15(2), 67--86 (2002)Google Scholar
  5. 5.
    Alon, N., Spencer. J.H: The probabilistic method. Wiley, New York, NY (1991)Google Scholar
  6. 6.
    Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing 16, 5--110 (2003)CrossRefGoogle Scholar
  7. 7.
    Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. Distributed Computing 15(3), 177--189 (2002)CrossRefGoogle Scholar
  8. 8.
    Attiya, H., Fouren, A.: Algorithms adaptive to point contention. Journal of the ACM 50(4), 444--468 (2003)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87--96 (2002)CrossRefGoogle Scholar
  10. 10.
    Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient adaptive collect using randomization. In: Proceedings of the 18th Annual Conference on Distributed Computing, volume 3274 of Lecture Notes in Computer Science, pp 159--173. Springer (2004)Google Scholar
  11. 11.
    Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 289--297 (2000)Google Scholar
  12. 12.
    Guerraoui, R., Raynal, M.: A generic framework for indulgent consensus. In: Proceedings of the 23rd International Conference on Distributed Computing Systems, pp. 88--95 (2003)Google Scholar
  13. 13.
    Herlihy, M.: Wait-free synchronization. CM Transactions on Programming Languages and Systems 13(1), 124--149 (1991)Google Scholar
  14. 14.
    Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing 30(2), 438--456 (2000)CrossRefMathSciNetGoogle Scholar
  15. 15.
    Kim, Y.-J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Proceedings of the 14th International Symposium on Distributed Computing, volume 2180 of Lecture Notes in Computer Science, pp. 1--15 (2001)Google Scholar
  16. 16.
    Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1--39 (1995)CrossRefMathSciNetGoogle Scholar
  17. 17.
    Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge, UK (1995)Google Scholar

Copyright information

© Springer-Verlag 2005

Authors and Affiliations

  • Hagit Attiya
    • 1
  • Fabian Kuhn
    • 2
  • C. Greg Plaxton
    • 3
    • 4
  • Mirjam Wattenhofer
    • 5
  • Roger Wattenhofer
    • 2
  1. 1.Department of Computer ScienceThe TechnionHaifaIsrael
  2. 2.Deptartment of Information Technology and Electrical Engineering, ETH ZurichZurichSwitzerland
  3. 3.Department of Computer ScienceUniversity of Texas at AustinAustin
  4. 4.Akamai Technologies, Inc.Cambridge
  5. 5.Deptartment of Computer Science, ETH ZurichZurichSwitzerland

Personalised recommendations