Efficient adaptive collect algorithms

Yehuda Afek*, Yaron De Levie

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

5 Scopus citations


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).

Original languageEnglish
Pages (from-to)221-238
Number of pages18
JournalDistributed Computing
Issue number3
StatePublished - Oct 2007


Dive into the research topics of 'Efficient adaptive collect algorithms'. Together they form a unique fingerprint.

Cite this