Coursebooks 2016-2017

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 and exercises

Expected student activities

Attendance at lectures completing exercise and sometimes doing a project

Assessment methods

With continuous control, mid-term final exams and sometimes project

Supervision

Office hours Yes
Assistants Yes
Forum No

Resources

Websites

In the programs

Reference week

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

legend

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