Tight space bounds for \(\ell\)-exclusion

DOI10.1007/s00446-014-0207-6zbMath1291.68058OpenAlexW2034352470MaRDI QIDQ2251155

Gadi Taubenfeld

Publication date: 11 July 2014

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

Full work available at URL: https://doi.org/10.1007/s00446-014-0207-6

zbMATH Keywords

mutual exclusionspace complexitytight bounds\(\ell\)-exclusion

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Cites Work

• On interprocess communication. I: Basic formalism
• On interprocess communication. II: Algorithms
• Fault-tolerant critical section management in asynchronous environments
• Bounds on shared memory for mutual exclusion
• Impossibility of distributed consensus with one faulty process
• Using local-spin k -exclusion algorithms to improve wait-free object implementations
• Long lived adaptive splitter and applications
• The mutual exclusion problem
• Unnamed Item

This page was built for publication: Tight space bounds for \(\ell\)-exclusion