MO441 - Computação Distribuída

(also MC964A)
1st Semester 2016
Mondays and Wednesdays, 14:00-16:00, room CC51/IC3

Prof. Ricardo Anido

Room37 - IC01

Program

In this course we will focus on a fundamental aspect of Distributed Computing: distributed algorithms. In general, distributed algorithms are more difficult to design, analyze, implement and debug than sequential algorithms. Today, they are used in a multitude of real systems, in a wide range of applications.

There exists a rich theory in distributed algorithms, comprising modelling the computing environment, types of problems, methods for analyzing correctness and complexity, and impossibility results (important because they prove that some problems cannot be solved in some models of distributed computing).

During the course we will study several classical problems, which involve communication, synchronization, resource management and consensus -- all important in solving the practical problems that arise when trying to solve some of the common jobs of today, be it indexing pages in the internet or writing collaborative tools for mobile devices.

Grading

Grades will be determined by a combination of four exams (one and half hours) and class participation. The weight of these will be