Fiches de cours

Concurrent algorithms

CS-453

Enseignant(s) :

Guerraoui Rachid

Langue:

English

Summary

With the advent of multiprocessors, it becomes crucial to master the underlying algorithmics of concurrency. The objective of this course is to study the foundations of concurrent algorithms and in particular the techniques that enable the construction of robust such algorithms.

Content

Model of a parallel system

 A Multicore architect
Processes and objects
Safety and liveness


Parallel programming
Automatic parallelism
Mutual exclusion and locks
Non-blocking data structures

 

Register Implementations
Safe, regular and atomic registers
General and limited transactions
Atomic snapshots

 

Hierarchy of objects
The FLP impssibility
The consensus number
Universal constructions

 

Transactional memories
Transactional algorithms
Opacity and obstruction-freedom

Keywords

Concurrency, parallelism, algorithms, data structures

Learning Prerequisites

Required courses

ICC, operatings systems

Recommended courses

Algorithms, concurrency

Important concepts to start the course

Processes, threads, datas structures

Learning Outcomes

By the end of the course, the student must be able to:

Teaching methods

Lectures, exercises and practical work

Expected student activities

Midterm and final exam

Project

Assessment methods

With continuous control, midterm final exams and project

Supervision

Office hours Yes
Assistants Yes
Forum No

Resources

Notes/Handbook

Concurrent Algorithms, R. Guerraoui and P. Kouznetsov

Websites

Dans les plans d'études

Semaine de référence

 LuMaMeJeVe
8-9INM202    
9-10    
10-11     
11-12     
12-13     
13-14 SG0211   
14-15 SG0211   
15-16 SG0211   
16-17 SG0211   
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Cours
      Exercice, TP
      Projet, autre

légende

  • Semestre d'automne
  • Session d'hiver
  • Semestre de printemps
  • Session d'été
  • Cours en français
  • Cours en anglais
  • Cours en allemand