Kursens beskrivning

LEARNING OUTCOMES

After this course, you will be able to design and analyse efficient distributed algorithms for problems that are related to computer networks and other distributed systems. You will also know how to prove that your algorithm is as fast as possible, i.e., the same problem cannot be solved faster with any distributed algorithm.

Credits: 5

Schedule: 25.02.2022 - 25.02.2022

Teacher in charge (valid for whole curriculum period):

Teacher in charge (applies in this implementation): Jukka Suomela

Contact information for the course (applies in this implementation):

CEFR level (valid for whole curriculum period):

Language of instruction and studies (applies in this implementation):

Teaching language: English. Languages of study attainment: English

CONTENT, ASSESSMENT AND WORKLOAD

Content

• valid for whole curriculum period:

  This course provides an introduction to the theory of distributed algorithms. The topics include algorithmic techniques that can be used to solve graph problems efficiently in very large networks, as well as fundamental impossibility results that set limits to distributed computing.

DETAILS

Study Material

• valid for whole curriculum period:

  Available online.

Substitutes for Courses

• valid for whole curriculum period:

  Substitutes for Courses

Prerequisites

• valid for whole curriculum period:

  Prerequisites

SDG: Sustainable Development Goals

9 Industry, Innovation and Infrastructure

FURTHER INFORMATION

Further Information

• valid for whole curriculum period:

  Teaching Period:

  2020-2021 Autumn I-II

  2021-2022 Autumn I-II

  Course Homepage: https://mycourses.aalto.fi/course/search.php?search=CS-E4510

  Registration for Courses: In the academic year 2021-2022, registration for courses will take place on Sisu (sisu.aalto.fi) instead of WebOodi.

Beskrivning