Space efficient processor identity protocol

DOI10.1016/0020-0190(90)90094-EzbMATH Open0695.68024OpenAlexW2080862022MaRDI QIDQ910199FDOQ910199

Shang-Hua Teng

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)90094-e

Recommendations

• The processor identity problem
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• Identity assignment in uniform synchronous rings
• scientific article
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms

zbMATH Keywords

protocoldistributed computationasynchronous parallel computationProcessor Identity Problem

Mathematics Subject Classification ID

Theory of software (68N99) Theory of operating systems (68N25)

Cites Work

• The mutual exclusion problem
• The choice coordination problem
• Proof of a structured program: 'The sieve of Eratosthenes'

Cited In (7)

• Anonymous and fault-tolerant shared-memory computing
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• The computational power of population protocols
• Identity assignment in uniform synchronous rings
• Naming symmetric processes using shared variables
• The processor identity problem
• Relationships between broadcast and shared memory in reliable anonymous distributed systems

This page was built for publication: Space efficient processor identity protocol

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