Leader-based de-anonymization of an anonymous read/write memory

DOI10.1016/j.tcs.2020.07.027zbMath1452.68025OpenAlexW3044215911MaRDI QIDQ2193278

Michel Raynal, Emmanuel Godard, Gadi Taubenfeld, Damien Imbs

Publication date: 25 August 2020

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2020.07.027

zbMATH Keywords

symmetry breakingleader electionanonymous read/write registersmemory de-anonymizationsynchronization barrier

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (1)

A visit to mutual exclusion in seven dates

Cites Work

• Unnamed Item
• Anonymous asynchronous systems: the case of failure detectors
• On interprocess communication. I: Basic formalism
• Myths about the mutual exclusion problem
• The choice coordination problem
• Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
• Computing in totally anonymous asynchronous shared memory systems
• Anonymous and fault-tolerant shared-memory computing
• Anonymous Read/write memory: leader election and de-anonymization
• Set agreement power is not a precise characterization for oblivious deterministic anonymous objects
• Mutual exclusion in fully anonymous shared memory systems
• Concurrent Programming: Algorithms, Principles, and Foundations
• Self-stabilizing systems in spite of distributed control
• Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
• Coordination Without Prior Agreement

This page was built for publication: Leader-based de-anonymization of an anonymous read/write memory