Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)

DOI10.1145/277697.277749zbMath1333.68270OpenAlexW1996313988MaRDI QIDQ2790117

Hagit Attiya, Arie Fouren

Publication date: 2 March 2016

Published in: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (7)

Efficient adaptive collect algorithms ⋮ Long lived adaptive splitter and applications ⋮ An adaptive collect algorithm with applications ⋮ Adaptive and efficient mutual exclusion ⋮ Shared-memory mutual exclusion: major research trends since 1986 ⋮ Unnamed Item ⋮ On the cost of uniform protocols whose memory consumption is adaptive to interval contention

This page was built for publication: Adaptive wait-free algorithms for lattice agreement and renaming (extended abstract)