Article contents
Weak symmetry breaking and abstract simplex paths
Published online by Cambridge University Press: 16 February 2015
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 a theorem of Castañeda 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.
- Type
- Paper
- Information
- Mathematical Structures in Computer Science , Volume 25 , Issue 6 , September 2015 , pp. 1432 - 1462
- Copyright
- Copyright © Cambridge University Press 2015
References
- 3
- Cited by