Impossibility Results for Distributed Computing

Impossibility Results for Distributed Computing

Hagit Attiya, Faith Ellen
ISBN: 9781627051705 | PDF ISBN: 9781627051712
Copyright © 2015 | 162 Pages | Publication Date: 06/01/2014

BEFORE YOU ORDER: You may have Academic or Corporate access to this title. Click here to find out: 10.2200/S00551ED1V01Y201311DCT012

Ordering Options: Paperback $35.00   E-book $28.00   Paperback & E-book Combo $43.75


Why pay full price? Members receive 15% off all orders.
Learn More Here

Read Our Digital Content License Agreement (pop-up)

Purchasing Options:



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

About the Author(s)

Hagit Attiya, Technion: Israel Institute of Technology

Faith Ellen, University of Toronto

Reviews
Browse by Subject
Case Studies in Engineering
ACM Books
IOP Concise Physics
SEM Books
0 items
LATEST NEWS

Newsletter
Note: Registered customers go to: Your Account to subscribe.

E-Mail Address:

Your Name: