Parallel and distributed algorithmic - KAIN8M08

Informations générales

  • Number of hours

    • Lectures 15.0
    • Projects -
    • Tutorials 15.0
    • Internship -
    • Laboratory works -
    • Written tests 2.0

    ECTS

    ECTS 0.5

Goal(s)

Objectives: understand the complexity of distributed systems.
Study and analyze some classical algorithms.
Understand the difficulty of observing and verifying distributed systems
Goals : Teach students the notion of abstraction, an abstract model of distributed system, the algorithmic approach.

Content(s)

Asynchronous model of a distributed system.
Wave algorithm.
Election.
Resource management and mutual exclusion.
Global state and snapshots.
Analysis and correction proof.
nProgramming.

Prerequisites

Sequential Algorithms
Notions of systems, distributed systems and networks

Calendar

The course exists in the following branches:

  • Curriculum - INFO - Semester 8

Additional Information

Course ID : KAIN8M08
Course language(s): FR

You can find this course among all other courses.

Bibliography

"Introduction to Distributed Algorithms" Gerard Tel
"Distributed Algorithms"Nancy Ann Lynch