The processor identity problem

DOI10.1016/0020-0190(90)90103-5zbMath0704.68007OpenAlexW2047846644MaRDI QIDQ917266

Arvin Park, Richard J. Lipton

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

probabilistic algorithmssynchronizationparallel algorithmsProcessor Identity Problemcomputer system initializationmultiprocessor coordination problems

Mathematics Subject Classification ID

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

Related Items

Tight Bounds for Asynchronous Renaming, EVENTUAL DETERMINISM: USING PROBABILISTIC MEANS TO ACHIEVE DETERMINISTIC ENDS, Anonymous Processors with Synchronous Shared Memory: Monte Carlo Algorithms, 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, Naming symmetric processes using shared variables, Fully-adaptive algorithms for long-lived renaming, Phase synchronization, Identity assignment in uniform synchronous rings, Available stabilizing heaps

Cites Work

• Unnamed Item
• The choice coordination problem
• The mutual exclusion problem
• The mutual exclusion problem