Image from Google Jackets

Impossibility Results for Distributed Computing / by Hagit Attiya, Faith Ellen

By: Attiya, Hagit, autor
Contributor(s): Ellen, Faith, (1956-), autor
Material type: materialTypeLabelE-bookSeries: (Synthesis Lectures on Distributed Computing Theory, 2155-1634).Publisher: Cham : Springer International Publishing, 2014Edition: 1st edition 2014.Description: 1 recurso en línea (XIII, 146 páginas).ISBN: 9783031020100.Subject: Lógica matemática | Complejidad computacional | Proceso distribuido (Informática)Online resources: Acceso a este recurso digital (usuarios Universidad Europea de Madrid)Digital Resources
Contents:
Acknowledgments -- Introduction -- Indistinguishability -- Shifting and Scaling -- Scenario Arguments -- Information Theory Arguments -- Covering Arguments -- Valency Arguments -- Combinatorial Arguments -- Reductions and Simulations -- Bibliography -- Authors' Biographies.
Summary: 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.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Collection Call number Status Date due Barcode Item holds
LIBRO-E NO PRÉSTAMO LIBRO-E NO PRÉSTAMO Madrid Digital Acceso Electrónico (UEM) Ciencias e Ingeniería QA76.9.D5 2014 EB (Browse shelf(Opens below)) Acceso electrónico eBook.01112508
Total holds: 0

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 on this title.

to post a comment.
Share