Space and Step Complexity Efficient Adaptive Collect

  • Yehuda Afek
  • Yaron De Levie
Conference paper

DOI: 10.1007/11561927_28

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3724)
Cite this paper as:
Afek Y., De Levie Y. (2005) Space and Step Complexity Efficient Adaptive Collect. In: Fraigniaud P. (eds) Distributed Computing. DISC 2005. Lecture Notes in Computer Science, vol 3724. Springer, Berlin, Heidelberg

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.

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