2026-07-25T08:40:19Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:17214 2024-03-06T10:59:14Z ddc:004 open_access

Fault Tolerant Coloring of the Asynchronous Cycle Fraigniaud, Pierre Lambein-Monette, Patrick Rabie, Mikaël graph coloring LOCAL model shared-memory model immediate snapshot renaming wait-free algorithms We present a wait-free algorithm for proper coloring the n nodes of the asynchronous cycle C_n, where each crash-prone node starts with its (unique) identifier as input. The algorithm is independent of n ≥ 3, and runs in O(log^*n) rounds in C_n. This round-complexity is optimal thanks to a known matching lower bound, which applies even to synchronous (failure-free) executions. The range of colors used by our algorithm, namely {0,…,4}, is optimal too, thanks to a known lower bound on the minimum number of names for which renaming is solvable wait-free in shared-memory systems, whenever n is a power of a prime. Indeed, our model coincides with the shared-memory model whenever n = 3, and the minimum number of names for which renaming is possible in 3-process shared-memory systems is 5. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Pierre Fraigniaud and Patrick Lambein-Monette and Mikaël Rabie 2022 Is Part Of LIPIcs, Volume 246, 36th International Symposium on Distributed Computing (DISC 2022) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.DISC.2022.23 urn:nbn:de:0030-drops-172147 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.DISC.2022.23 eng https://creativecommons.org/licenses/by/4.0/legalcode