Fully-adaptive algorithms for long-lived renaming

DOI10.1007/s00446-011-0137-5zbMath1231.68067OpenAlexW2005147105MaRDI QIDQ661054

Faith Ellen, Philipp Woelfel, Alex Brodsky

Publication date: 6 February 2012

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

Full work available at URL: https://doi.org/10.1007/s00446-011-0137-5

zbMATH Keywords

adaptivityshared memoryasynchronousfault tolerantsynchronousrenaming

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

A closer look at fault tolerance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The processor identity problem
• Wait-free implementations in message-passing systems
• Wait-free algorithms for fast, long-lived renaming
• Adaptive and Efficient Algorithms for Lattice Agreement and Renaming
• New combinatorial topology upper and lower bounds for renaming
• Asynchronous exclusive selection
• Optimal-time adaptive strong renaming, with applications to counting
• Algorithms adapting to point contention
• Renaming in an asynchronous environment
• Time bounds for decision problems in the presence of timing uncertainty and failures

This page was built for publication: Fully-adaptive algorithms for long-lived renaming