Chapter 5
Solvability of Colorless Tasks in Different Models
Abstract
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 
-resilient protocols, and protocols that work against adversaries.
Keywords
-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 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.
