Impossibility Results for Distributed Computing
Par : ,Formats :
- Réservation en ligne avec paiement en magasin :
- Indisponible pour réserver et payer en magasin
- Nombre de pages146
- PrésentationBroché
- FormatGrand Format
- Poids0.33 kg
- Dimensions19,0 cm × 23,5 cm × 1,0 cm
- ISBN978-3-031-00882-5
- EAN9783031008825
- Date de parution19/06/2014
- CollectionSynthesis Lectures on Distrib
- ÉditeurSpringer
Résumé
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 highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make, inadequate for solving certain problems efficiently are identified, and different system models are compared.
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 highlighted, aspects of a problem that make it difficult are isolated, features of an architecture that make, inadequate for solving certain problems efficiently are identified, and different system models are compared.