Randomized naming using wait-free shared variables

MaRDI QIDQ5137352zbMATH OpenFDO

Authors Alessandro Panconesi, Marina Papatriantafilou, Philippas Tsigas, Paul M. B. Vitányi

Publication date 2 December 2020

Full work available at URL https://link.springer.com/article/10.1007/s004460050045

zbMATH Keywords

adaptive adversaryasynchronous distributed protocolsatomicityfault-tolerancenaming problemrandomized algorithmsshared memorysymmetry breakingtest-and-set objectsunique process IDwait-free read/write registers

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Recommendations

• scientific article; zbMATH DE number 1555924
• Fast randomized test-and-set and renaming
• Randomized loose renaming in \(O(\log \log n)\) time
• Asynchronous exclusive selection
• Wait-free algorithms for fast, long-lived renaming

Cited in

(8)

• Efficient randomized test-and-set implementations
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• How to share concurrent wait-free variables
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• scientific article; zbMATH DE number 1555924 (Why is no real title available?)
• An almost tight RMR lower bound for abortable test-and-set
• Naming symmetric processes using shared variables
• Randomized two-process wait-free test-and-set

This page was built for publication: Randomized naming using wait-free shared variables

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