Adaptive and efficient mutual exclusion

DOI10.1007/S004460100068zbMath1448.68064OpenAlexW2070993796MaRDI QIDQ5138379

Vita Bortnikov, Hagit Attiya

Publication date: 3 December 2020

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s004460100068

zbMATH Keywords

adaptive algorithmspoint contentionread/write operationsremote step complexitysystem response time

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (1)

Computing with infinitely many processes

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Myths about the mutual exclusion problem
• Speeding Lamport's fast mutual exclusion algorithm
• Wait-free algorithms for fast, long-lived renaming
• Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)
• Renaming in an asynchronous environment
• Impossibility of distributed consensus with one faulty process
• A new solution of Dijkstra's concurrent programming problem
• Adaptive solutions to the mutual exclusion problem
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)
• Improving fast mutual exclusion

This page was built for publication: Adaptive and efficient mutual exclusion