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...
Uložené v:
| Vydané v: | Distributed computing Ročník 20; číslo 3; s. 221 - 238 |
|---|---|
| Hlavní autori: | , |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
Heidelberg
Springer Nature B.V
01.10.2007
|
| ISSN: | 0178-2770, 1432-0452 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Shrnutí: | 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] |
|---|---|
| Bibliografia: | ObjectType-Article-1 SourceType-Scholarly Journals-1 content type line 14 |
| ISSN: | 0178-2770 1432-0452 |
| DOI: | 10.1007/s00446-007-0041-1 |