Simulations and Reductions for Colored Tasks
Abstract
In this chapter, we study simulations and reductions for colored tasks. Earlier, in Chapter 7, we studied simulations and reductions for colorless tasks and showed how to construct reductions from one failure model to another. Because the tasks under consideration were colorless, we had considerable flexibility to move between models that encompass different numbers of processes.
Keywords
Immediate snapshot model; Layered immediate snapshot model; Layered snapshot model; Read-write model; Reduction; Shared-memory model; Snapshot model; Simulation
In this chapter we show how to use the results of Chapter 11 to study simulations and reductions for colored tasks. Earlier, in Chapter 7 ...
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.
