Long lived adaptive splitter and applications

DOI10.1007/s004460100060zbMath1448.68056OpenAlexW1970345854MaRDI QIDQ5138373

Yehuda Afek, Gideon Stupp, Dan Touitou

Publication date: 3 December 2020

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

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

Mathematics Subject Classification ID

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

Related Items (5)

Computing with infinitely many processes ⋮ Nonatomic mutual exclusion with local spinning ⋮ Tight space bounds for \(\ell\)-exclusion ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention ⋮ Correctness and concurrent complexity of the black-white bakery algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• 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)
• The asynchronous computability theorem for t-resilient tasks
• Improving fast mutual exclusion
• Adaptive solutions to the mutual exclusion problem
• Using k-exclusion to implement resilient, scalable shared objects (extended abstract)
• Long-lived renaming made fast
• Immediate atomic snapshots and fast renaming

This page was built for publication: Long lived adaptive splitter and applications