Sub-logarithmic Test-and-Set against a Weak Adversary
- Cite this paper as:
- Alistarh D., Aspnes J. (2011) Sub-logarithmic Test-and-Set against a Weak Adversary. In: Peleg D. (eds) Distributed Computing. DISC 2011. Lecture Notes in Computer Science, vol 6950. Springer, Berlin, Heidelberg
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.
Unable to display preview. Download preview PDF.