The renaming problem: recent developments and open questions

MaRDI QIDQ4967197zbMATH OpenFDO

Authors Dan Alistarh

Publication date 3 July 2019

Full work available at URL http://bulletin.eatcs.org/index.php/beatcs/article/view/381/361

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15) Randomized algorithms (68W20)

Recommendations

• Tight bounds for asynchronous renaming
• Fast randomized test-and-set and renaming
• Randomized loose renaming in \(O(\log \log n)\) time
• Renaming in an asynchronous environment
• The renaming problem in shared memory systems: an introduction

Cited in

(16)

• Wait-free algorithms for fast, long-lived renaming
• Optimal parallel randomized renaming
• New combinatorial topology upper and lower bounds for renaming
• Balls-into-leaves, sub-logarithmic renaming in synchronous message-passing systems
• Freshness and Name-Restriction in Sets of Traces with Names
• Tight bounds for asynchronous renaming
• Renaming in an asynchronous environment
• Fast randomized test-and-set and renaming
• scientific article; zbMATH DE number 1555924 (Why is no real title available?)
• Bounds on the step and namespace complexity of renaming
• The renaming problem in shared memory systems: an introduction
• Upper bound on the complexity of solving hard renaming
• Randomized loose renaming in \(O(\log \log n)\) time
• Tasks in modular proofs of concurrent algorithms
• Tasks in modular proofs of concurrent algorithms
• Renaming in distributed certification

This page was built for publication: The renaming problem: recent developments and open questions

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