Sub-logarithmic Test-and-Set against a Weak Adversary

Dan Alistarh, James Aspnes

Abstract: A randomized implementation is given of a test-and-set register with O(log log n) individual step complexity and O(n) total step complexity against an oblivious adversary. The implementation is linearizable and multi-shot, and shows an exponential complexity improvement over previous solutions designed to work against a strong adversary.