Impossibility results for distributed computing
Author(s)
Bibliographic Information
Impossibility results for distributed computing
（Synthesis lectures on distributed computing theory, 12）（Synthesis collection of technology）
Springer, c2022
- : pbk
Available at / 1 libraries
-
No Libraries matched.
- Remove all filters.
Note
Reprint. Originally published: Morgan & Claypool, c2014
Includes bibliographical references (p. 135-140) and index
Description and Table of Contents
Description
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.
Table of Contents
Acknowledgments.- Introduction.- Indistinguishability.- Shifting and Scaling.- Scenario Arguments.- Information Theory Arguments.- Covering Arguments.- Valency Arguments.- Combinatorial Arguments.- Reductions and Simulations.- Bibliography.- Authors' Biographies.
by "Nielsen BookData"