CSI 5308
Principles of Distributed Computing

Topics (Tentative)

The goal of the course is to introduce the notion of distributed algorithms and the main problems of distributed computing, to show the basic techniques for the design and the analysis of distributed algorithms and to give the tools for comparing different solutions to the same problem.

Distributed Environments
The Model
Examples
Coordination and Control
Broadcast
Spanning Tree construction
Computations in the tree
Saturation technique
Function evaluation
Elections
In the Ring
In the Complete Network
In the Chordal Ring
In the Hypercube
In Arbitrary networks
Sense of Direction
Operations on Distributed Data
Ranking,
Sorting, ...
Routing
Classical techniques
Compact Routing Techniques
Synchronous Computations
Distributed Mobile Computing
Selected problems with agents
Autonomous Mobile Robots
Algorithms by mobile robots