Space and step complexity efficient adaptive collect

Yehuda Afek, Yaron De Levie

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Space and step complexity efficient deterministic adaptive to total contention collect algorithms are presented. One of them has an optimal O(k) step and O(n) space complexities, but restrict the processes identifiers size to O(n). Where n is the total number of processes in the system and k is the total contention, the total number of processes active during the execution. Unrestricting the name space increases the space complexity to O(n2) leaving the step complexity at O(k). To date all deterministic adaptive collect algorithms that we are aware of are either nearly quadratic in their step complexity or their memory overhead is exponential in n.

Original languageEnglish
Title of host publicationDistributed Computing - 19th International Conference, DISC 2005, Proceedings
Pages384-398
Number of pages15
DOIs
StatePublished - 2005
Event19th International Conference on Distributed Computing, DISC 2005 - Cracow, Poland
Duration: 26 Sep 200529 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3724 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference19th International Conference on Distributed Computing, DISC 2005
Country/TerritoryPoland
CityCracow
Period26/09/0529/09/05

Fingerprint

Dive into the research topics of 'Space and step complexity efficient adaptive collect'. Together they form a unique fingerprint.

Cite this