Adaptive randomized mutual exclusion in sub-logarithmic expected time

DOI10.1145/1835698.1835737zbMath1315.68270OpenAlexW1999332309MaRDI QIDQ5176194

Danny Hendler, Philipp Woelfel

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1835698.1835737

zbMATH Keywords

distributed algorithmsmutual exclusionadaptiveremote memory referencesRMRs

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (2)

A time complexity lower bound for adaptive mutual exclusion ⋮ Unnamed Item

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Adaptive randomized mutual exclusion in sub-logarithmic expected time