Space and Step Complexity Efficient Adaptive Collect

  • Yehuda Afek
  • Yaron De Levie
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3724)

Abstract

Space and step complexity efficient deterministic adaptive to total contention collect algorithms are presented. One of them has an optimal O(k) step and O(n) space complexities, but restrict the processes identifiers size to O(n). Where n is the total number of processes in the system and k is the total contention, the total number of processes active during the execution. Unrestricting the name space increases the space complexity to O(n2) leaving the step complexity at O(k). To date all deterministic adaptive collect algorithms that we are aware of are either nearly quadratic in their step complexity or their memory overhead is exponential in n.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AAD+93]
    Afek, Y., Attiya, H., Dolev, D., Gafni, E., Merritt, M., Shavit, N.: Atomic snapshots of shared memory. J. ACM 40(4), 873–890 (1993)MATHCrossRefGoogle Scholar
  2. [AAF+99]
    Afek, Y., Attiya, H., Fouren, A., Stupp, G., Touitou, D.: Long-lived renaming made adaptive. In: PODC 1999: Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing, pp. 91–103. ACM Press, New York (1999)CrossRefGoogle Scholar
  3. [AD]
    Afek, Y., De Levie, Y.: Space and step complexity efficient adaptive collect, http://www.cs.tau.ac.il/~afek/papers/collect.pdf
  4. [AF98]
    Attiya, H., Fouren, A.: Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract). In: PODC 1998: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pp. 277–286. ACM Press, New York (1998)CrossRefGoogle Scholar
  5. [AF03]
    Attiya, H., Fouren, A.: Algorithms adapting to point contention. J. ACM 50(4), 444–468 (2003)CrossRefMathSciNetGoogle Scholar
  6. [AFG02]
    Attiya, H., Fouren, A., Gafni, E.: An adaptive collect algorithm with applications. Distributed Computing 15(2), 87–96 (2002)CrossRefGoogle Scholar
  7. [AFK04]
    Attiya, H., Fich, F.E., Kaplan, Y.: Lower bounds for adaptive collect and related objects. In: PODC 2004: Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing, pp. 60–69. ACM Press, New York (2004)CrossRefGoogle Scholar
  8. [AKWW]
    Attiya, H., Kuhn, F., Wattenhofer, M., Wattenhofer, R.: Efficient adaptive collect using randomization. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 159–173. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  9. [AST99]
    Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 262–272 (1999)Google Scholar
  10. [MA95]
    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 2005

Authors and Affiliations

  • Yehuda Afek
    • 1
  • Yaron De Levie
    • 1
  1. 1.School of Computer ScienceTel-Aviv UniversityIsrael

Personalised recommendations