
Distributed Computing
Principles, Algorithms, and Systems
- English
- PDF
- Available on iOS & Android
About this book
Designing distributed computing systems is a complex process requiring a solid understanding of the design problems and the theoretical and practical aspects of their solutions. This comprehensive textbook covers the fundamental principles and models underlying the theory, algorithms and systems aspects of distributed computing. Broad and detailed coverage of the theory is balanced with practical systems-related issues such as mutual exclusion, deadlock detection, authentication, and failure recovery. Algorithms are carefully selected, lucidly presented, and described without complex proofs. Simple explanations and illustrations are used to elucidate the algorithms. Important emerging topics such as peer-to-peer networks and network security are also considered. With vital algorithms, numerous illustrations, examples and homework problems, this textbook is suitable for advanced undergraduate and graduate students of electrical and computer engineering and computer science. Practitioners in data networking and sensor networks will also find this a valuable resource. Additional resources are available online at www.cambridge.org/9780521876346.
Frequently asked questions
- Essential is ideal for learners and professionals who enjoy exploring a wide range of subjects. Access the Essential Library with 800,000+ trusted titles and best-sellers across business, personal growth, and the humanities. Includes unlimited reading time and Standard Read Aloud voice.
- Complete: Perfect for advanced learners and researchers needing full, unrestricted access. Unlock 1.4M+ books across hundreds of subjects, including academic and specialized titles. The Complete Plan also includes advanced features like Premium Read Aloud and Research Assistant.
Please note we cannot support devices running on iOS 13 and Android 7 or earlier. Learn more about using the app.
Information
Table of contents
- Cover
- Half-title
- Title
- Copyright
- Dedication
- Contents
- Preface
- CHAPTER 1 Introduction
- CHAPTER 2 A model of distributed computations
- CHAPTER 3 Logical time
- CHAPTER 4 Global state and snapshot recording algorithms
- CHAPTER 5 Terminology and basic algorithms
- CHAPTER 6 Message ordering and group communication
- CHAPTER 7 Termination detection
- CHAPTER 8 Reasoning with knowledge
- CHAPTER 9 Distributed mutual exclusion algorithms
- CHAPTER 10 Deadlock detection in distributed systems
- CHAPTER 11 Global predicate detection
- CHAPTER 12 Distributed shared memory
- CHAPTER 13 Checkpointing and rollback recovery
- CHAPTER 14 Consensus and agreement algorithms
- CHAPTER 15 Failure detectors
- CHAPTER 16 Authentication in distributed systems
- CHAPTER 17 Self-stabilization
- CHAPTER 18 Peer-to-peer computing and overlay graphs
- Index