DeepRead
Cover of Distributed Computing Through Combinatorial Topology

Distributed Computing Through Combinatorial Topology

Maurice Herlihy, Dmitry Kozlov, Sergio Rajsbaum · 2013

Mathematics and physics › Numerical and matrix computation

#10,199 most recommended

About the book

The book covers distributed computing, the study of systems of processes that communicate through shared memory or message passing and must cope with failures and asynchrony. It uses tools from combinatorial and algebraic topology, such as simplicial and chromatic complexes, subdivisions, and homology, to model these systems and their executions. Its scope is mainly the theory of wait-free and asynchronous computation. Executions of a distributed protocol can be represented as geometric objects, so questions about what a system can compute become questions about topological structure. Connectivity and holes in these complexes determine whether tasks such as consensus, set agreement, and renaming are solvable. The authors develop a general characterization of which tasks are solvable and show that topological invariants explain classic impossibility results and the lower bounds on the protocols that achieve them.

Written by Claude from what it knows of this book.

What Hacker News says 100% recommend · 0% critical

00.51202020212022202320242020 peak · 1
This bookAverage book in Numerical and matrix computation

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

  • 1 want to read
  • 0 reading
  • 0 have read

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
2013
ISBN
9780124045781
Editions known
4 at Open Library
Open Library
OL17545587W

Combinatorial topologyDistributed processingElectronic data processingElectronic data processing, distributed processingMathematics

Explore in the mosaic

Read next: its neighbours on the mosaic