Colorless Wait-Free Computation
Abstract
We outline the basic connection between distributed computing and combinatorial topology in terms of two formal models: a conventional operational model, in which systems consist of communicating state machines whose behaviors unfold over time, and the combinatorial model, in which all possible behaviors are captured statically using topological notions. We start with one particular system model (shared memory) and focus on a restricted (but important) class of problems (so-called “colorless” tasks).
Keywords
Configurations; Executions; Layered executions; Layered protocols; Processes; Protocols; Schedules; Tasks
We saw in Chapter 2 that we can construct a combinatorial theory of two-process distributed ...
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.
