Distributed computing : principles, algorithms, and systems / Ajay D. Kshemkalyani and Mukesh Singhal.
Material type: TextPublisher: Cambridge : Cambridge University Press, 2008Description: 1 online resource (xvii, 736 pages) : digital, PDF file(s)Content type:- text
- computer
- online resource
- 9780511805318 (ebook)
- 004.36 22
- QA76.9.D5 K74 2008
Title from publisher's bibliographic system (viewed on 05 Oct 2015).
Part I. Models and Foundations: 1. Introductions; 2. Classical distributed algorithms; 3. Formal models of distributed execution; 4. Logical time; 5. Physical time; 6. Global state and snapshot recoding algorithms; 7. Message ordering and group communication; 8. Reasining using knowledge; Part II. Observation and Synchronization: 9. Global predicate detection; 10. Termination detection; 11. Distributed mutual exclusion; 12. Distributed deadlock detection; 13. Shared memory; Part III. Handling Failures and Providing Fault-Tolerance: 14. Checkpoiting and failure recovery; 15. Self-stabilizing systems; 16. Consensus algorithms for agreement; 17. Failure detectors; Part IV. Topics of Emerging Importance: 18. Authentication and key-exchange; 19. Mobile computing systems; 20. Peer-to-peer computing; 21. Emerging distributed computing environments.
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.
There are no comments on this title.