分布式计算原理(讲演集)
jopen
9年前
分布式计算是现代计算和通信系统的基础。在大规模网络系统方面的一个例子是互联网，而在多处理器方面的一个例子则是新式多核笔记本电脑。下面的这些 讲演材料介绍了分布式计算的原理，重点围绕设计分布式系统和网络中基本问题：通信，协作，错误容忍，本地化，并行，自组织，对称破裂，同步，不确定性。我 们将探索其中的基本算法思想和下限技术，基本上都是分布式计算的重点。每一章都是一个新的主题。
下面章节的顺序有些随意。每个章节几乎相对独立，而且有引用到其它章节的内容。
讲演材料
| 标题 | 说明 | 练习 | 其它资料 |
|---|---|---|---|
| Chapter 0 Introduction | PDF 1:1 | ||
| Chapter 1 Vertex Coloring | PDF 1:1 | Exercises | Slides by S.Schmid, TU Berlin |
| Chapter 2 Leader Election | PDF 1:1 | Exercises | Slides by S.Schmid, TU Berlin |
| Chapter 3 Tree Algorithms | PDF 1:1 | Exercises | Slides by S.Schmid, TU Berlin |
| Chapter 4 Distributed Sorting | PDF 1:1 | Exercises | |
| Chapter 5 Shared Memory | PDF 1:1 | Exercises | |
| Chapter 6 Shared Objects | PDF 1:1 | Exercises | |
| Chapter 7 Maximal Independent Set | PDF 1:1 | Exercises | Slides by R. Wattenhofer Slides by S.Schmid, TU Berlin |
| Chapter 8 Locality Lower Bounds | PDF 1:1 | Exercises | Slides by S.Schmid, TU Berlin Ramsey Theory Slides by J. Suomela Alternative Version thanks! |
| Chapter 9 Social Networks | PDF 1:1 | Exercises | Slides by S.Schmid, TU Berlin |
| Chapter 10 Synchronizers | PDF 1:1 | Exercises | |
| Chapter 11 Hard Problems | PDF 1:1 | Exercises | Slides some additional Slides Animation of APSP Algorihm by Jukka Suomela |
| Chapter 12 Stabilization | PDF 1:1 | Exercises | |
| Chapter 13 Wireless Protocols | PDF 1:1 | Exercises | |
| Chapter 14 Peer-to-Peer Computing | PDF 1:1 | Exercises | Slides by S.Schmid, TU Berlin Slides from a talk at P2P |
| Chapter 15 Dynamic Networks | PDF 1:1 | Exercises | |
| Chapter 16 All-to-All Communication | PDF 1:1 | Exercises | Slides |
| Chapter 17 Consensus | PDF 1:1 | Exercises | Slides |
| Chapter 18 Multi-Core Computing | PDF 1:1 | Slides | |
| Chapter 19 Dominating Set | PDF 1:1 | Exercises | |
| Chapter 20 Routing | PDF 1:1 | ||
| Chapter 21 Routing Strikes Back | PDF 1:1 | ||
| All Chapters Principles of Distributed Computing | PDF 1:1 |