Skip to main content
SpringerLink
Log in

Efficient adaptive collect using randomization

  • Special Issue: Disc 04
  • Published:
Distributed Computing Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  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)

  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)

  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)

  4. Afek, Y., Stupp, G., Touitou., D.: Long lived adaptive splitter and applications. Distributed Computing 15(2), 67--86 (2002)

    Google Scholar 

  5. Alon, N., Spencer. J.H: The probabilistic method. Wiley, New York, NY (1991)

    Google Scholar 

  6. Anderson, J., Kim, Y.-J., Herman, T.: Shared-memory mutual exclusion: Major research trends since 1986. Distributed Computing 16, 5--110 (2003)

    Article  Google Scholar 

  7. Attiya, H., Bortnikov, V.: Adaptive and efficient mutual exclusion. Distributed Computing 15(3), 177--189 (2002)

    Article  Google Scholar 

  8. Attiya, H., Fouren, A.: Algorithms adaptive to point contention. Journal of the ACM 50(4), 444--468 (2003)

    Article  MathSciNet  Google Scholar 

  9. Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87--96 (2002)

    Article  Google Scholar 

  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)

  11. Guerraoui, R.: Indulgent algorithms. In: Proceedings of the 19th Annual ACM Symposium on Principles of Distributed Computing, pp. 289--297 (2000)

  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)

  13. Herlihy, M.: Wait-free synchronization. CM Transactions on Programming Languages and Systems 13(1), 124--149 (1991)

    Google Scholar 

  14. Jayanti, P., Tan, K., Toueg, S.: Time and space lower bounds for nonblocking implementations. SIAM Journal on Computing 30(2), 438--456 (2000)

    Article  MathSciNet  Google Scholar 

  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)

  16. Moir, M., Anderson, J.H.: Wait-free algorithms for fast, long-lived renaming. Science of Computer Programming 25(1), 1--39 (1995)

    Article  MathSciNet  Google Scholar 

  17. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, Cambridge, UK (1995)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, The Technion, Haifa, 32000, Israel

    Hagit Attiya

  2. Deptartment of Information Technology and Electrical Engineering, ETH Zurich, 8092, Zurich, Switzerland

    Fabian Kuhn & Roger Wattenhofer

  3. Department of Computer Science, University of Texas at Austin, 1 University Station C0500, Austin, 78712-0233, Texas

    C. Greg Plaxton

  4. Akamai Technologies, Inc., Cambridge, 02142, MA

    C. Greg Plaxton

  5. Deptartment of Computer Science, ETH Zurich, 8092, Zurich, Switzerland

    Mirjam Wattenhofer

Authors
  1. Hagit Attiya
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Fabian Kuhn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. C. Greg Plaxton
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mirjam Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Roger Wattenhofer
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hagit Attiya.

Additional information

Partially supported by NSF Grants CCR–0310970 and ANI–0326001.

A preliminary version of this paper appeared in the Proceedings of the 18th Annual Conference on Distributed Computing (DISC) 2004 [10].

Rights and permissions

Reprints and permissions

About this article

Cite this article

Attiya, H., Kuhn, F., Plaxton, C.G. et al. Efficient adaptive collect using randomization. Distrib. Comput. 18, 179–188 (2006). https://doi.org/10.1007/s00446-005-0143-6

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-005-0143-6

Keywords

Search

Navigation