Impossibility Results for Distributed Computing

Erscheinungsjahr 2014
ISBN: 978-1-62705-170-5
Verlag: Morgan & Claypool Publishers

Buch, Englisch, 162 Seiten, Paperback, Format (B × H): 187 mm x 235 mm

Reihe: Synthesis Lectures on Distributed Computing Theory

To understand the power of distributed systems, it is necessary to understand their inherent limitations: what problems cannot be solved in particular systems, or without sufficient resources (such as time or space). This book presents key techniques for proving such impossibility results and applies them to a variety of different problems in a variety of different system models. Insights gained from these results are highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make it inadequate for solving certain problems efficiently are identified, and different system models are compared.

Autoren/Hrsg.

Inhaltsverzeichnis

- Acknowledgments
- Introduction
- Indistinguishability
- Shifting and Scaling
- Scenario Arguments
- Information Theory Arguments
- Covering Arguments
- Valency Arguments
- Combinatorial Arguments
- Reductions and Simulations
- Bibliography
- Authors' Biographies