Chapter

Distributed Computing

Volume 3724 of the series Lecture Notes in Computer Science pp 384-398

Space and Step Complexity Efficient Adaptive Collect

  • Yehuda AfekAffiliated withSchool of Computer Science, Tel-Aviv University
  • , Yaron De LevieAffiliated withSchool of Computer Science, Tel-Aviv University

* Final gross prices may vary according to local VAT.

Get Access

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(n 2) 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.