The processor identity problem

DOI10.1016/0020-0190(90)90103-5MaRDI QIDQ917266zbMATH OpenOpenAlexFDO

Authors Richard J. Lipton, Arvin Park

Publication date 1990

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(90)90103-5

zbMATH Keywords

synchronizationparallel algorithmsprobabilistic algorithmsProcessor Identity Problemcomputer system initializationmultiprocessor coordination problems

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Network design and communication in computer systems (68M10)

Recommendations

• Space efficient processor identity protocol
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• Anonymous and fault-tolerant shared-memory computing
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• Identity assignment in uniform synchronous rings

Cites work

• scientific article; zbMATH DE number 3126031 (Why is no real title available?)
• The choice coordination problem
• The mutual exclusion problem
• The mutual exclusion problem

Cited in

(17)

• EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS
• Anonymous and fault-tolerant shared-memory computing
• The anti-FPU problem
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• On the importance of having an identity or, is consensus really universal?
• scientific article; zbMATH DE number 1324647 (Why is no real title available?)
• scientific article; zbMATH DE number 19351 (Why is no real title available?)
• Phase synchronization
• Available stabilizing heaps
• The computational power of population protocols
• Identity assignment in uniform synchronous rings
• Naming symmetric processes using shared variables
• Tight bounds for asynchronous renaming
• Space efficient processor identity protocol
• Fully-adaptive algorithms for long-lived renaming
• Relationships between broadcast and shared memory in reliable anonymous distributed systems
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms

This page was built for publication: The processor identity problem

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