DISTRIBUTED ALGORITHMS : AN INTUITIVE APPROACH, SECOND EDITION
WAN FOKKINK
Sold by Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
AbeBooks Seller since 17 April 2013
New - Hardcover
Condition: New
Quantity: 1 available
Add to basketSold by Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
AbeBooks Seller since 17 April 2013
Condition: New
Quantity: 1 available
Add to basketThis is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Seller Inventory # ABNR-15232
The new edition of a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models.
This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. The algorithms presented in the book are for the most part “classics,” selected because they shed light on the algorithmic design of distributed systems or on key issues in distributed computing and concurrent programming.
This second edition has been substantially revised. A new chapter on distributed transaction offers up-to-date treatment of database transactions and the important evolving area of transactional memory. A new chapter on security discusses two exciting new topics: blockchains and quantum cryptography. Sections have been added that cover such subjects as rollback recovery, fault-tolerant termination detection, and consensus for shared memory. An appendix offers pseudocode descriptions of many algorithms. Solutions and slides are available for instructors.
Distributed Algorithms can be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field.
"About this title" may belong to another edition of this title.
We guarantee the condition of every book as it's described on the Abebooks web
sites. If you're dissatisfied with your purchase (Incorrect Book/Not as
Described/Damaged) or if the order hasn't arrived, you're eligible for a refund
within 30 days of the estimated delivery date. If you've changed your mind about
a book that you've ordered, please use the Ask bookseller a question link to
contact us and we'll respond within 2 business days. The contact persons name is
Constantin Marandici and the m...
Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required. We use USPS, DHL and ARAMEX for shipping.