Efficient Adaptive Collect Using Randomization

  • Hagit Attiya
  • Fabian Kuhn
  • Mirjam Wattenhofer
  • Roger Wattenhofer
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3274)

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 polynomial memory overhead only. In addition we present a new deterministic collect algorithm which beats the best step complexity for previous polynomial-memory algorithms.

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 (PODC), 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 (FOCS), pp. 262–272. IEEE Computer Society Press, Los Alamitos (1999)Google Scholar
  3. 3.
    Afek, Y., Strupp, G., Touitou, D.: Long-lived and adaptive splitters and applications, vol. 15, pp. 444–468 (2002)Google Scholar
  4. 4.
    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 (PODC), pp. 71–80 (2000)Google Scholar
  5. 5.
    Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing 16, 75–110 (2003)CrossRefGoogle Scholar
  6. 6.
    Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. Distributed Computing 15(3), 177–189 (2002)CrossRefGoogle Scholar
  7. 7.
    Attiya, H., Fouren, A.: Algorithms Adaptive to Point Contention. Journal of the ACM (JACM) 50(4), 444–468 (2003)CrossRefMathSciNetGoogle Scholar
  8. 8.
    Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)CrossRefGoogle Scholar
  9. 9.
    Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 289–297 (2000)Google Scholar
  10. 10.
    Guerraoui, R., Raynal, M.: A generic framework for indulgent consensus. In: Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS), pp. 88–95 (2003)Google Scholar
  11. 11.
    Herlihy, M.: Wait-free synchronization. ACM Transactions on Programming Languages and Systems 13(1), 124–149 (1991)CrossRefGoogle Scholar
  12. 12.
    Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing 30(2), 438–456 (2000)MATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kim, Y.-J., Anderson, J.: A time complexity bound for adaptive mutual exclusion. In: Welch, J.L. (ed.) DISC 2001. LNCS, vol. 2180, pp. 1–15. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  14. 14.
    Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1–39 (1995)MATHCrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Hagit Attiya
    • 1
  • Fabian Kuhn
    • 2
  • Mirjam Wattenhofer
    • 2
  • Roger Wattenhofer
    • 2
  1. 1.Department of Computer ScienceTechnion 
  2. 2.Department of Computer ScienceETH Zurich 

Personalised recommendations