Randomized wait-free naming

DOI10.1007/3-540-58325-4_169MaRDI QIDQ4525687zbMATH OpenFDO

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

Publication date 24 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/5165

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Randomized naming using wait-free shared variables
• Fast randomized test-and-set and renaming
• Randomized loose renaming in \(O(\log \log n)\) time
• Wait-free algorithms for fast, long-lived renaming
• The renaming problem: recent developments and open questions

Cited in

(7)

• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Anonymous and fault-tolerant shared-memory computing
• The computational power of population protocols
• Fast randomized test-and-set and renaming
• Randomized naming using wait-free shared variables
• Randomized two-process wait-free test-and-set
• Space-optimal naming in population protocols

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

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