TY - JOUR
T1 - Efficient adaptive collect algorithms
AU - Afek, Yehuda
AU - De Levie, Yaron
PY - 2007/10
Y1 - 2007/10
N2 - 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).
AB - 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).
UR - http://www.scopus.com/inward/record.url?scp=35148876420&partnerID=8YFLogxK
U2 - 10.1007/s00446-007-0041-1
DO - 10.1007/s00446-007-0041-1
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:35148876420
SN - 0178-2770
VL - 20
SP - 221
EP - 238
JO - Distributed Computing
JF - Distributed Computing
IS - 3
ER -