Sign up
Forgot password?
FAQ: Login

Wattenhofer R. Principles of Distributed Computing

  • pdf file
  • size 1,95 MB
  • added by
  • info modified
Wattenhofer R. Principles of Distributed Computing
Zurich: ETH, 2016. — 321 p.
What is Distributed Computing?
Course Overview
Problem & Model
Coloring Trees
Broadcast
Convergecast
BFS Tree Construction
MST Construction
Anonymous Leader Election
Anonymous Ring
Lower Bounds
Synchronous Ring
Array & Mesh
Sorting Networks
Counting Networks
Model
Mutual Exclusion
Problem Definition
Splitters
Binary Splitter Tree
Splitter Matrix
Centralized Solutions
Arrow and Friends
Ivy and Friends
MIS
Original Fast MIS
Fast MIS v
Applications
Model
Locality
The Neighborhood Graph
Social Networks
Small World Networks
Propogation Studies
Basics
The Local Synchronizer Alpha
The Global Synchronizer Beta
The Hybrid Synchronizer Gamma
Network Partition
Clock Synchronization
Diameter & APSP
Lower Bound Graphs
Communication Complexity
Distributed Complexity Theory
Basics
Uniform Initialization with CD
With High Probability
Uniform Leader Election
Even Faster Leader Election with CD
Uniform Asynchronous Wakeup without CD
Useful Formulas
Self-Stabilization
Advanced Stabilization
Adjacency
Rooted Trees
Road Networks
Client/Server
Paxos
Consensus
Impossibility of Consensus
Randomized Consensus
Shared Coin
Byzantine Agreement
Validity
How Many Byzantine Nodes?
The King Algorithms
Lower Bound on Number of Rounds
Asynchronous Byzantine Agreement
Agreement with Authentication
Zyzzyva
Quorum Systems
Load and Work
Grid Quorum Systems
Fault Tolerance
Byzantine Quorum Systems
Consistency, Availability and Partitions
Bitcoin
Smart Contracts
Weak Consistency
Consistent Hashing
Hypercubic Networks
DHT & Churn
Prisoner's Dilemma
Selfish Caching
Braess' Paradox
Rock-Paper-Scissors
Mechanism Design
Synchronous Edge-Dynamic Networks
Problem Definitions
Basic Information Dissemination
k-Verification
k-Committee Election
More Stable Graphs
All-to-All Communication
The Current State of Concurrent Programming
Transaction Memory
Contention Management
Dominating Set
Sequential Greedy Algorithm
Distributed Greedy Algorithm
Array
Mesh
Routing in the Mesh with Small Queues
Hot-Potato Routing
Butterfly
Oblivious Routing
Offline Routing
  • Sign up or login using form at top of the page to download this file.
  • Sign up
Up