Distributed Computing: Principles, Algorithms, and Systems / Edition 1 available in Hardcover
- Pub. Date:
- Cambridge University Press
|Publisher:||Cambridge University Press|
|Edition description:||New Edition|
|Product dimensions:||7.40(w) x 9.80(h) x 1.50(d)|
About the Author
Ajay D. Kshemkalyani is an associate professor in the Department of Computer Science, at the University of Illinois at Chicago. He was awarded his PhD in Computer and Information Science in 1991 from The Ohio State University. Before moving to academia, he spent several years working on computer networks at IBM Research Triangle Park. In 1999, he received the National Science Foundation's CAREER Award. He is a senior member of the IEEE, and his principal areas of research include distributed computing, algorithms, computer networks, and concurrent systems. He currently serves on the editorial board of Computer Networks.
Mukesh Singhal is Full Professor and Gartner Group Endowed Chair in Network Engineering in the Department of Computer Science at the University of Kentucky. He was awarded his PhD in Computer Science in 1986 from the University of Maryland, College Park. In 2003, he received the IEEE Technical Achievement Award, and currently serves on the editorial boards for the IEEE Transactions on Parallel and Distributed Systems and the IEEE Transactions on Computers. He is a Fellow of the IEEE, and his principal areas of research include distributed systems, computer networks, wireless and mobile computing systems, performance evaluation, and computer security.
Table of Contents1. Introduction; 2. A model of distributed computations; 3. Logical time; 4. Global state and snapshot recording algorithms; 5. Terminology and basic algorithms; 6. Message ordering and group communication; 7. Termination detection; 8. Reasoning with knowledge; 9. Distributed mutual exclusion algorithms; 10. Deadlock detection in distributed systems; 11. Global predicate detection; 12. Distributed shared memory; 13. Checkpointing and rollback recovery; 14. Consensus and agreement algorithms; 15. Failure detectors; 16. Authentication in distributed system; 17. Self-stabilization; 18. Peer-to-peer computing and overlay graphs; Index.
Most Helpful Customer Reviews
This is an amazing text book, and by far the best in the area. The range
of topics covered is very comprehensive, from theory and algorithms to
systems. It maintains a very good balance between theory, algorithms and
systems, without compromising on any of these three aspects of distributed
computing. For example, it covers the more traditional and basic topics
(such as global state and time, termination detection, mutual exclusion,
multicast and group communication ...) side by side with advanced and more
complex topics (such as failure detectors, self-stabilization, consensus,
shared memory, peer-to-peer networks ...), all in a single book.
The writing style throughout is very nice and authoritative. Each chapter
is well-structured. The algorithms are explained in a easy to understand manner after the pseudo-code. The exposition of each topic is very clear, making it interesting reading. This is a must-read for anyone interested in learning the essentials of distributed computing.