Election in fully anonymous shared memory systems: tight space bounds and algorithms

DOI10.1007/978-3-031-09993-9_10OpenAlexW4285223202MaRDI QIDQ2097346

Michel Raynal, Damien Imbs, Gadi Taubenfeld

Publication date: 11 November 2022

Full work available at URL: https://arxiv.org/abs/2203.02988

zbMATH Keywords

leader electionsymmetry-breakingdistributed computabilitytight boundsanonymous processesanonymous memoryprocess participationread-modify-write registerread-write register

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx) Communication complexity, information complexity (68Q11)

Cites Work

• Unnamed Item
• Unnamed Item
• On interprocess communication. I: Basic formalism
• Some beautiful arguments using mathematical induction
• 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
• The epigenetic consensus problem
• Mutual exclusion in fully anonymous shared memory systems
• Computing without communicating: ring exploration by asynchronous oblivious robots
• Distributed Algorithms for Message-Passing Systems
• Concurrent Programming: Algorithms, Principles, and Foundations
• Optimal Memory-Anonymous Symmetric Deadlock-Free Mutual Exclusion
• Coordination Without Prior Agreement
• From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems
• Distributed Computing
• Proofs from THE BOOK

This page was built for publication: Election in fully anonymous shared memory systems: tight space bounds and algorithms