Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Sub-Logarithmic Test-and-Set Against a Weak Adversary
 
conference paper

Sub-Logarithmic Test-and-Set Against a Weak Adversary

Alistarh, Dan  
•
Aspnes, James
2011
Distributed Computing. DISC 2011
25th International Symposium, DISC 2011

A randomized implementation is given of a test-and-set register with O(log log it) 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.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

paper.pdf

Access type

openaccess

Size

305.9 KB

Format

Adobe PDF

Checksum (MD5)

549466acfbb0a14465899f7a510b0deb

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés