Atomic snapshots of shared memory
Journal of the ACM (JACM)
Wait-free algorithms for fast, long-lived renaming
Science of Computer Programming
Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
PODC '98 Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing
Long-lived renaming made adaptive
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Algorithms adapting to point contention
Journal of the ACM (JACM)
Long-Lived Adaptive Collect with Applications
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Lower bounds for adaptive collect and related objects
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
An adaptive collect algorithm with applications
Distributed Computing
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
Space and step complexity efficient adaptive collect
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Space and step complexity efficient adaptive collect
DISC'05 Proceedings of the 19th international conference on Distributed Computing
| Hi-index | 0.00 |
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.