Two-Process Systems
Abstract
This chapter is an introduction to how techniques and models from combinatorial topology can be applied to distributed computing by focusing exclusively on two-process systems. It explores several distributed computing models, still somewhat informally, to illustrate the main ideas.
Keywords
Carrier map; Coloring; Decision map; Edge; Graph theory; Input graph; Labeling; Output graph; Protocol graph; Simplex; Vertex
This chapter is an introduction to how techniques and models from combinatorial topology can be applied to distributed computing by focusing exclusively on two-process systems. It explores several distributed computing models, still somewhat informally, to illustrate the main ideas.
For two-process ...
Get Distributed Computing Through Combinatorial Topology now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
