November 2013
Intermediate to advanced
336 pages
9h 56m
English
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.
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 ...
Read now
Unlock full access