The Las-Vegas Processor Identity Problem (How and When to Be Unique)

DOI10.1006/JAGM.2000.1110MaRDI QIDQ4521525zbMATH OpenOpenAlexFDO

Authors Shay Kutten, Rafail Ostrovsky, Boaz Patt-Shamir

Publication date 16 July 2001

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jagm.2000.1110

zbMATH Keywords

asynchronous shared memory modelLas-Vegas protocol

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Parallel algorithms in computer science (68W10)

Recommendations

• The processor identity problem
• Space efficient processor identity protocol
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• Randomized naming using wait-free shared variables
• Naming symmetric processes using shared variables

Cited in

(10)

• On the smallest grain of salt to get a unique identity
• On the importance of having an identity or, is consensus really universal?
• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Anonymous and fault-tolerant shared-memory computing
• The computational power of population protocols
• Tight bounds for asynchronous renaming
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• Naming symmetric processes using shared variables
• Space efficient processor identity protocol
• The processor identity problem

This page was built for publication: The Las-Vegas Processor Identity Problem (How and When to Be Unique)

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