Attiya, Hagit.
Impossibility Results for Distributed Computing [electronic resource] / by Hagit Attiya, Faith Ellen. - 1st ed. 2014. - XIII, 146 p. online resource. - Synthesis Lectures on Distributed Computing Theory, 2155-1634 . - Synthesis Lectures on Distributed Computing Theory, .
Acknowledgments -- Introduction -- Indistinguishability -- Shifting and Scaling -- Scenario Arguments -- Information Theory Arguments -- Covering Arguments -- Valency Arguments -- Combinatorial Arguments -- Reductions and Simulations -- Bibliography -- Authors' Biographies.
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.
9783031020100
10.1007/978-3-031-02010-0 doi
Computer science.
Coding theory.
Information theory.
Data structures (Computer science).
Computer Science.
Coding and Information Theory.
Data Structures and Information Theory.
QA75.5-76.95
004
Impossibility Results for Distributed Computing [electronic resource] / by Hagit Attiya, Faith Ellen. - 1st ed. 2014. - XIII, 146 p. online resource. - Synthesis Lectures on Distributed Computing Theory, 2155-1634 . - Synthesis Lectures on Distributed Computing Theory, .
Acknowledgments -- Introduction -- Indistinguishability -- Shifting and Scaling -- Scenario Arguments -- Information Theory Arguments -- Covering Arguments -- Valency Arguments -- Combinatorial Arguments -- Reductions and Simulations -- Bibliography -- Authors' Biographies.
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.
9783031020100
10.1007/978-3-031-02010-0 doi
Computer science.
Coding theory.
Information theory.
Data structures (Computer science).
Computer Science.
Coding and Information Theory.
Data Structures and Information Theory.
QA75.5-76.95
004