Naming symmetric processes using shared variables

DOI10.1007/BF02283568MaRDI QIDQ5136976zbMATH OpenFDO

Authors Ömer Eğecioğlu, Ambuj Singh

Publication date 30 November 2020

Published in Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02283568

zbMATH Keywords

parallel algorithmsynchronizationrandomized protocol

Mathematics Subject Classification ID

Randomized algorithms (68W20) Parallel algorithms in computer science (68W10) Distributed systems (68M14)

Recommendations

• Randomized naming using wait-free shared variables
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• Symmetric and economical solutions to the mutual exclusion problem in a distributed system
• The renaming problem in shared memory systems: an introduction

Cites work

• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• Atomic snapshots of shared memory
• Fast randomized consensus using shared memory
• On interprocess communication. II: Algorithms
• Space efficient processor identity protocol
• Symmetry breaking in distributed networks
• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• The choice coordination problem
• The processor identity problem
• Time, clocks, and the ordering of events in a distributed system

Cited in

(2)

• The Las-Vegas Processor Identity Problem (How and When to Be Unique)
• Anonymous processors with synchronous shared memory: Monte Carlo algorithms

Describes a project that uses

Uses Software

• UNITY

This page was built for publication: Naming symmetric processes using shared variables

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