, Volume 20, Issue 3, pp 221-238
Date: 07 Sep 2007

Efficient adaptive collect algorithms

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


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