Efficient adaptive collect algorithms
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), w...
Saved in:
| Published in: | Distributed computing Vol. 20; no. 3; pp. 221 - 238 |
|---|---|
| Main Authors: | , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Heidelberg
Springer Nature B.V
01.10.2007
|
| ISSN: | 0178-2770, 1432-0452 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | 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). [PUBLICATION ABSTRACT] |
|---|---|
| Bibliography: | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| ISSN: | 0178-2770 1432-0452 |
| DOI: | 10.1007/s00446-007-0041-1 |