Course

CS-451: Distributed algorithms

Summary

Computing is nowadays distributed over several machines, in a local IP-like network, a cloud or a P2P network. Failures are common and computations need to proceed despite partial failures of machines or communication links. This course will study the foundations of reliable distributed computing.

Lectures

Instructors

Official source

https://edu.epfl.ch/coursebook/en/distributed-algorithms-CS-451

Moodle Page

http://go.epfl.ch/CS-451

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Summary

Lectures

Instructors

Official source

https://edu.epfl.ch/coursebook/en/distributed-algorithms-CS-451

Moodle Page

http://go.epfl.ch/CS-451

About this result

Lectures in this course (29)

Exam Q&A Session

Is a Q&A session covering algorithm correctness, rank functions, and message complexity in distributed systems.

Lecture: Introduction Q&A

Distributed Algorithms: Exam Review

Covers a review of past exams on distributed algorithms, focusing on key concepts such as Terminating Reliable Broadcast, Consensus, and Leader Election.

PhD Thesis: Structure, Process, and EPFL Experience

Explores the structure and process of a PhD thesis, along with the EPFL experience.

Conditional Statements & Graph Theory

Covers conditional statements and graph theory, including proof techniques and concepts related to graphs, paths, connectivity, and gossip protocols.

Related courses (30)

COM-490: Large-scale data science for real-world data

This hands-on course covers tools and methods used by data scientists, from researching solutions to scaling prototypes on Spark clusters. Students engage with the full data engineering and data science pipeline, from data acquisition to extracting insight ...

CS-438: Decentralized systems engineering

A decentralized system is one that works when no single party is in charge or fully trusted. This course teaches decentralized systems principles while guiding students through the engineering of their own decentralized system featuring messaging, file sha ...

CS-423: Distributed information systems

This course introduces the foundations of information retrieval, data mining and knowledge bases, which constitute the foundations of today's Web-based distributed information systems. ...

CS-101: Advanced information, computation, communication I

Discrete mathematics is a discipline with applications to almost all areas of study. It provides a set of indispensable tools to computer science in particular. This course reviews (familiar) topics as diverse as mathematical reasoning, combinatorics, disc ...

CS-471: Advanced multiprocessor architecture

Multiprocessors are basic building blocks for all computer systems. This course covers the architecture and organization of modern multiprocessors, prevalent accelerators (e.g., GPU, TPU), and datacenters. It includes a research project on multiprocessors ...