Central Library

Normal view MARC view ISBD view

Impossibility Results for Distributed Computing [electronic resource] / by Hagit Attiya, Faith Ellen.

By: Attiya, Hagit [author.].
Contributor(s): Ellen, Faith [author.] | SpringerLink (Online service).
Material type: materialTypeLabelBookSeries: Synthesis Lectures on Distributed Computing Theory: Publisher: Cham : Springer International Publishing : Imprint: Springer, 2014Edition: 1st ed. 2014.Description: XIII, 146 p. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783031020100.Subject(s): Computer science | Coding theory | Information theory | Data structures (Computer science) | Computer Science | Coding and Information Theory | Data Structures and Information TheoryAdditional physical formats: Printed edition:: No title; Printed edition:: No titleDDC classification: 004 Online resources: Click here to access online
Contents:
Acknowledgments -- Introduction -- Indistinguishability -- Shifting and Scaling -- Scenario Arguments -- Information Theory Arguments -- Covering Arguments -- Valency Arguments -- Combinatorial Arguments -- Reductions and Simulations -- Bibliography -- Authors' Biographies.
In: Springer Nature eBookSummary: 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.
    average rating: 0.0 (0 votes)
No physical items for this record

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.

There are no comments for this item.

Log in to your account to post a comment.