Department of Teleinformatics

A Course on Distributed Algorithms

Prof. Seif Haridi, Computer Systems

This is a web page including current information about the Ph.D. course on Distributed Algorithms, given by the Department of Teleinformatics at the Royal Institute of Technology. The course is based on the book: Introduction to Distributed Algorithms, by Gerard Tel, Cambridge University Press, ISBN 0 521 47069 2. The book will be augmented with material on three extra subjects namely, distributed garbage collection algorithms, mobile objects protocols, and distributed unification algorithms.

Content

  1. Introduction, and overview of the course
  2. Distributed programming model
  3. Communication Protocols
  4. Routing Algorithms
  5. Deadlock-free packet switching
  6. Wave and traversal algorithms
  7. Election algorithms
  8. Termination detection
  9. Snapshots
  10. Synchrony in networks
  11. Mobile objects protocols
  12. Distributed garbage collection
  13. Distributed unification
  14. Fault tolerance in distributed systems
  15. Fault tolerance in asynchronous systems
  16. Fault tolerance in synchronous systems
  17. Stabilization algorithms

Important Dates

The course will start in November week 47. And continue two nominal hours each week:

1997-11-19, time: 15:00-17:00 place: SICS seminar room, third floor.

1997-11-26, time: 15:00-17:00 place: SICS seminar room, third floor. 1997-12-3, time: 15:00-17:00 place: SICS seminar room, third floor. 1997-12-11, time: 15:00-17:00 place: SICS seminar room, third floor (NEW DATE)
1997-02-03, time: 10:00-12:00 place: Telegrafen, fifth floor

1997-02-13, time: 10:00-12:00 place: Telegrafen, fifth floor

 

Lecturers

Prof. Seif Haridi - Teleinformatics, Per Brand - SICS
If you have comments or suggestions, email me at seif@sics.se