Distributed Computing Through Combinatorial Topology Pdf -

: Each processor's local state is represented as a vertex. A set of compatible local states (states that can exist simultaneously) forms a "simplex"—the higher-dimensional analog of a triangle or tetrahedron [12, 15].

: A task is solvable in a given model if and only if there exists a continuous simplicial map from the "protocol complex" (the states reachable by an algorithm) to the output complex that respects the task's rules [1, 21]. Key Theoretical Breakthroughs distributed computing through combinatorial topology pdf

In renaming, processes start with unique names from a large domain and must pick new unique names from a smaller domain. The topological analysis shows that the renaming number —the smallest size of the new name space—is determined by the connectivity of certain complexes related to the symmetric group. For example: : Each processor's local state is represented as a vertex

Since the 2013 book, the field has evolved. Newer PDF resources that complement the original text include: Newer PDF resources that complement the original text