Bounds on shared memory for mutual exclusion
Information and Computation
On the space complexity of randomized synchronization
Journal of the ACM (JACM)
Wait-free Test-and-Set (Extended Abstract)
WDAG '92 Proceedings of the 6th International Workshop on Distributed Algorithms
Fast, Long-Lived Renaming (Extended Abstract)
WDAG '94 Proceedings of the 8th International Workshop on Distributed Algorithms
Long-Lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput
DISC '98 Proceedings of the 12th International Symposium on Distributed Computing
Randomized two-process wait-free test-and-set
Distributed Computing
Efficient adaptive collect using randomization
Distributed Computing - Special issue: DISC 04
Probabilistic computations: Toward a unified measure of complexity
SFCS '77 Proceedings of the 18th Annual Symposium on Foundations of Computer Science
A modular approach to shared-memory consensus, with applications to the probabilistic-write model
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast randomized test-and-set and renaming
DISC'10 Proceedings of the 24th international conference on Distributed computing
An $O(1)$ RMRs Leader Election Algorithm
SIAM Journal on Computing
Sub-logarithmic test-and-set against aweak adversary
DISC'11 Proceedings of the 25th international conference on Distributed computing
Lower Bounds for Randomized Consensus under a Weak Adversary
SIAM Journal on Computing
Faster randomized consensus with an oblivious adversary
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Faster randomized consensus with an oblivious adversary
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Randomized loose renaming in o(log log n) time
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Brief announcement: resettable objects and efficient memory reclamation for concurrent algorithms
Proceedings of the 2013 ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
We study the time and space complexity of randomized Test-And-Set (TAS) implementations from atomic read/write registers in asynchronous shared memory models with n processes. We present an adaptive TAS algorithm with an expected (individual) step complexity of O(log* k), for contention k, against the oblivious adversary, improving a previous (non-adaptive) upper bound of O(log log n) (Alistarh and Aspnes, 2011). We also present a modified version of the adaptive RatRace TAS algorithm (Alistarh et al., 2010), which improves the space complexity from O(n3) to O(n), while maintaining logarithmic expected step complexity against the adaptive adversary. We complement this upper bound with an Ω(log n) lower bound on the space complexity of any TAS algorithm that has the nondeterministic solo-termination property (which is a weaker progress condition than wait-freedom). No non-trivial lower bounds on the space requirements of TAS were known prior to this work.