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

Full description

Bibliographic Details

Published in:	Distributed computing Vol. 20; no. 3; pp. 221 - 238
Main Authors:	Afek, Yehuda, De Levie, Yaron
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!