Randomized loose renaming in O( n) time

DOI10.1145/2484239.2484240MaRDI QIDQ5176095zbMATH OpenOpenAlexFDO

Authors Dan Alistarh, James Aspnes, George Giakkoupis, Philipp Woelfel

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

distributed computinglower boundsrenamingshared memoryupper bounds

Mathematics Subject Classification ID

Distributed systems (68M14) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Fast randomized test-and-set and renaming
• Tight bounds for asynchronous renaming
• The renaming problem: recent developments and open questions
• Optimal-time adaptive strong renaming, with applications to counting
• scientific article; zbMATH DE number 2006648

Cited in

(9)

• Optimal parallel randomized renaming
• Optimal-time adaptive strong renaming, with applications to counting
• Balls-into-leaves, sub-logarithmic renaming in synchronous message-passing systems
• Tight bounds for asynchronous renaming
• Fast randomized test-and-set and renaming
• scientific article; zbMATH DE number 1555924 (Why is no real title available?)
• The renaming problem: recent developments and open questions
• Randomized naming using wait-free shared variables
• Upper bound on the complexity of solving hard renaming

This page was built for publication: Randomized loose renaming in \(O(\log \log n)\) time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5176095)