Chapter 5

Solvability of Colorless Tasks in Different Models


This chapter explores the circumstances under which colorless tasks can be solved in different communication models, satisfying different fault-tolerance requirements. We consider both shared memory and message-passing models, wait-free and image-resilient protocols, and protocols that work against adversaries.


image-resilient; Adversaries; Layered snapshot protocols; Message-passing protocols; Wait-free

In Chapter 4 we considered colorless layered immediate snapshot protocols and ...

Get Distributed Computing Through Combinatorial Topology now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.