Distributed Algorithms: An Intuitive Approach (2nd Edition)
The new edition of a guide to distributed algorithmsthat emphasizes examples and exercises rather than the intricaciesof mathematical models.This book offers students and researchers a guide to distributedalgorithms that emphasizes examples and exercises rather than theintricacies of mathematical models. It avoids mathematicalargumentation, often a stumbling block for students, teachingalgorithmic thought rather than proofs and logic. This approachallows the student to learn a large number of algorithms within arelatively short span of time. Algorithms are explained throughbrief, informal descriptions, illuminating examples, and practicalexercises. The examples and exercises allow readers to understandalgorithms intuitively and from different perspectives. Proofsketches, arguing the correctness of an algorithm or explaining theidea behind fundamental results, are also included. The algorithmspresented in the book are for the most part "classics," selectedbecause they shed light on the algorithmic design of distributedsystems or on key issues in distributed computing and concurrentprogramming.This second edition has been substantially revised. A newchapter on distributed transaction offers up-to-date treatment ofdatabase transactions and the important evolving area oftransactional memory. A new chapter on security discusses twoexciting new topics: blockchains and quantum cryptography. Sectionshave been added that cover such subjects as rollback recovery,fault-tolerant termination detection, and consensus for sharedmemory. An appendix offers pseudocode descriptions of manyalgorithms. Solutions and slides are available for instructors.Distributed Algorithms can be used in courses forupper-level undergraduates or graduate students in computerscience, or as a reference for researchers in the field.