Ajay D. KshemkalyaniCambridge University PressEdition: Reissue, 3/3/2011EAN 9780521189842, ISBN10: 0521189845Paperback, 756 pages, 24.6 x 18.9 x 4.3 cmLanguage: EnglishDesigning 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.1. Introduction2. A model of distributed computations3. Logical time4. Global state and snapshot recording algorithms5. Terminology and basic algorithms6. Message ordering and group communication7. Termination detection8. Reasoning with knowledge9. Distributed mutual exclusion algorithms10. Deadlock detection in distributed systems11. Global predicate detection12. Distributed shared memory13. Checkpointing and rollback recovery14. Consensus and agreement algorithms15. Failure detectors16. Authentication in distributed system17. Self-stabilization18. Peer-to-peer computing and overlay graphsIndex.
Related
Related
Related
Related