Skip to main content
SpringerLink
Log in

Efficient adaptive collect algorithms

  • Published:
Distributed Computing Aims and scope Submit manuscript

Abstract

Deterministic collect algorithms are presented that are adaptive to total contention and are efficient with respect to both the number of registers used and the step complexity. One of them has optimal O(k) step and O(n) space complexities, but assumes that processes’ identifiers are in O(n), where n is the total number of processes in the system and k is the total contention. The step complexity of an unrestricted name space variant of this algorithm remains O(k), but its space complexity increases to O(n 2).

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., Attiya H., Dolev D., Gafni E., Merritt M. and Shavit N. (1993). Atomic snapshots of shared memory. J. ACM 40(4): 873–890

    Article  MATH  Google Scholar 

  2. Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In: PODC ’99: Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, pp. 91–103. ACM Press, New York, NY, USA (1999)

  3. Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract). In: PODC ’98: Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, pp. 277–286. ACM Press, New York, NY, USA (1998)

  4. Attiya H. and Fouren A. (2003). Algorithms adapting to point contention. J. ACM 50(4): 444–468

    Article  MathSciNet  Google Scholar 

  5. Attiya H., Fouren A. and Gafni E. (2002). An adaptive collect algorithm with applications. Distrib. Comput. 15(2): 87–96

    Article  Google Scholar 

  6. Attiya, H., Fich, F.E., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: PODC ’04: Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, pp. 60–69. ACM Press, New York, NY, USA (2004)

  7. Attiya H., Kuhn F., Plaxton C.G., Wattenhofer M. and Wattenhofer R. (2004). Efficient adaptive collect using randomization. Distrib. Comput. 18(3): 179–188 (Also in DISC ’04, see below)

    Article  Google Scholar 

  8. Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient adaptive collect using randomization. In: Guerraoui, R. (ed.) DISC ’04: 18th International Symposium on Distributed Computing, Amsterdam, The Netherlands, 4–7 October 2004, Proceedings, Lecture Notes in Computer Science, vol. 3274, pp. 159–173. Springer, Heidelberg (2004)

  9. Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: FOCS ’99: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 262–272 (1999)

  10. Attiya, H.: Adapting to point contention with long-lived safe agreement. In: SIROCCO, 13th Colloquium on Structural Information and Communication Complexity, 3–5 July, 2006, Chester, UK, Lecture Notes in Computer Science, pp. 10–23. Springer, Heidelberg (2006)

  11. Englert, B.: An efficient long-lived adaptive collect algorithm. In: 11th International Conference on Parallel and Distributed Systems (ICPADS 2005), 20–22 July 2005, Fuduoka, Japan, 2 Vols. IEEE Computer Society (2005)

  12. Gafni, E., Merritt, M., Taubenfeld, G.: The concurrency hierarchy, and algorithms for unbounded concurrency. In: PODC ’01: Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, pp. 161–169. ACM Press, New York, NY, USA (2001)

  13. Knuth D. (1997). The Art of Computer Programming, Volume 3, Sorting and Searching, 3rd edn. Addison-Wesley, Reading

    Google Scholar 

  14. Moir M. and Anderson J.H. (1995). Wait-free algorithms for fast, long-lived renaming. Sci. Comput. Program. 25(1): 1–39

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science, Tel-Aviv University, Tel Aviv, 69978, Israel

    Yehuda Afek & Yaron De Levie

Authors
  1. Yehuda Afek
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yaron De Levie
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yehuda Afek.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Afek, Y., De Levie, Y. Efficient adaptive collect algorithms. Distrib. Comput. 20, 221–238 (2007). https://doi.org/10.1007/s00446-007-0041-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00446-007-0041-1

Keywords

Search

Navigation