Coursebooks 2018-2019

PDF
 

Concurrent algorithms

CS-453

Lecturer(s) :

Guerraoui Rachid

Language:

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

In the programs

Reference week

 MoTuWeThFr
8-9INM202    
9-10    
10-11     
11-12     
12-13     
13-14 SG0211   
14-15 SG0211   
15-16 CM4
SG0211
   
16-17 CM4   
17-18     
18-19     
19-20     
20-21     
21-22     
 
      Lecture
      Exercise, TP
      Project, other

legend

  • Autumn semester
  • Winter sessions
  • Spring semester
  • Summer sessions
  • Lecture in French
  • Lecture in English
  • Lecture in German