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. An appendix offers pseudocode descriptions of many algorithms.
Distributed algorithms are performed by a collection of computers that send messages to each other or by multiple software threads that use the same shared memory. 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.
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.
具体描述
读后感
评分
评分
评分
评分
用户评价
非常基础的分布式计算算法，分为消息和共享内存两大类，覆盖了分布式计算的主要体系。
评分过于陈旧
评分过于陈旧
评分分布式系统算法的概述。算法并不全，但是面基本都点到了。读完Prof Lynch的分布式算法之后默默回来改成3星……
评分非常基础的分布式计算算法，分为消息和共享内存两大类，覆盖了分布式计算的主要体系。
相关图书
本站所有内容均为互联网搜索引擎提供的公开搜索信息，本站不存储任何数据与内容，任何内容与数据均与本站无关，如有需要请联系相关搜索引擎包括但不限于百度，google,bing,sogou 等
© 2025 book.quotespace.org All Rights Reserved. 小美书屋 版权所有