From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems

DOI10.1145/3382734.3405727OpenAlexW3046631266MaRDI QIDQ5855204

Damien Imbs, Gadi Taubenfeld, Michel Raynal, Emmanuel Godard

Publication date: 15 March 2021

Published in: Proceedings of the 39th Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-03148627/file/PODC-2020-Election-Anonymous-Memory.pdf

zbMATH Keywords

symmetry breakingconcurrent algorithmleader electionasynchronyatomic registerBezout identitysymmetric algorithmanonymous registerbounded registerequality-based comparisonprocess identityRW register

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (3)

A visit to mutual exclusion in seven dates ⋮ Agreeing within a few writes ⋮ Election in fully anonymous shared memory systems: tight space bounds and algorithms

This page was built for publication: From Bezout's Identity to Space-Optimal Election in Anonymous Memory Systems