Weak symmetry breaking and abstract simplex paths
Distributed, Parallel, and Cluster Computing
2019-02-20 v2 Combinatorics
Abstract
Motivated by questions in theoretical distributed computing, we develop the combinatorial theory of abstract simplex path subdivisions. Our main application is a short and structural proof of the theorem of Castaneda and Rajsbaum. This theorem in turn implies the solvability of the weak symmetry breaking task in the immediate snapshot wait-free model in the case when the number of processes is not a power of a prime number.
Cite
@article{arxiv.1311.7289,
title = {Weak symmetry breaking and abstract simplex paths},
author = {Dmitry N. Kozlov},
journal= {arXiv preprint arXiv:1311.7289},
year = {2019}
}
Comments
revised version, 30 pages To appear in Mathematical Structures in Computer Science