CS-453 / 5 credits

Teacher: 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

Keywords

Concurrency, parallelism, algorithms, data structures

Learning Prerequisites

Required courses

ICC, Operatings systems

Recommended courses

This course is complementary to the Distributed Algorithms course.

Important concepts to start the course

Processes, threads, datas structures

Learning Outcomes

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

  • Reason in a precise manner about concurrency
  • Design a concurrent algorithm
  • Prove a concurrent algorithm
  • Implement a concurrent system

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

  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks
  • Semester: Fall
  • Exam form: Written (winter session)
  • Subject examined: Concurrent algorithms
  • Lecture: 3 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 1 Hour(s) per week x 14 weeks

Reference week

 MoTuWeThFr
8-9INM202    
9-10    
10-11     
11-12     
12-13     
13-14 SG0211   
14-15 SG0211   
15-16 SG0211   
16-17     
17-18     
18-19     
19-20     
20-21     
21-22     

Tuesday, 13h - 14h: Lecture SG0211

Tuesday, 14h - 15h: Exercise, TP SG0211

Tuesday, 15h - 16h: Exercise, TP SG0211

Monday, 8h - 10h: Lecture INM202