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

  • Dan Alistarh
  • James Aspnes
Conference paper

DOI: 10.1007/978-3-642-24100-0_7

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6950)
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

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Dan Alistarh
    • 1
  • James Aspnes
    • 2
  1. 1.EPFLSwitzerland
  2. 2.Yale UniversityUSA

Personalised recommendations