Space and Step Complexity Efficient Adaptive Collect
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.
Unable to display preview. Download preview PDF.
- [AD]Afek, Y., De Levie, Y.: Space and step complexity efficient adaptive collect, http://www.cs.tau.ac.il/~afek/papers/collect.pdf
- [AST99]Afek, Y., Stupp, G., Touitou, D.: Long-lived adaptive collect with applications. In: FOCS 1999: Proceedings of the 40th Annual Symposium on Foundations of Computer Science, pp. 262–272 (1999)Google Scholar