Distributed Algorithms (Fall 2016)

Last updated:

This course focuses on the fundamental principles and models underlying all aspects of distributed algorithms. It also thoroughly addresses all practical system-like problems by presenting the theory behind and algorithms for such problems.

Textbook

A.D. Kshemkalyani and M. Singhal,, Distributed Computing Principles, Algorithms, and Systems, Cambridge University Press, March 2011.

Course Outline

All slides are placed in e-Campus.

On-line presentations

Unit 1, Chap. 1 Introduction

Unit 2, Chap. 1 Introduction
Unit 3, Chap. 1 Introduction
Unit 4, Chap. 1 Introduction
Unit 5, Chap. 1 Introduction
All other videos are available at E3 Syetem

References

Prof. Nany Lynch (MIT) on Synchronous Distributed Algorithms: Symmetry-Breaking. Shortest-Paths Spanning Trees

Announcement

All announcements are available in e-Campus.

Grading Policy

(40%) Homeworks, Quizzes, and Attendances.
(30%) Mid-term exam.
(30%) Final exam.

Maintained by Li-Hsing Yen.