Parallelism and concurrency

CS-206 / 4 credits

Teacher(s): Kashyap Sanidhya, Kuncak Viktor

Language: English

Remark: réservé aux étudiants de IC devant refaire la matière

Summary

Course no longer offered for new students; this edition is only a make-up course for those who repeated the year. Please log in with EPFL credentials and consult the mediaspace link below for course videos.

Content

Keywords

Parallelism, threads, synchronization, locks, memory models.

Learning Prerequisites

Required courses

  • Functional programming (CS-210)
  • Algorithms (CS-250)
  • Computer Architecture (CS-208)

Recommended courses

System oriented programming (CS-207)

Important concepts to start the course

Algorithms and data structures

Assessment methods

- Graded labs

- Midterm

- Final exam

Resources

Bibliography

Maurice Herlihy and Nir Shavit. 2012. The Art of Multiprocessor Programming, Revised Reprint (1st. ed.). Morgan Kaufmann Publishers Inc., San Francisco, CA, USA.
(available from EPFL library)

Ressources en bibliothèque

Moodle Link

Videos

In the programs

  • Semester: Spring
  • Exam form: During the semester (summer session)
  • Subject examined: Parallelism and concurrency
  • Lecture: 1 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 2 Hour(s) per week x 14 weeks
  • Semester: Spring
  • Exam form: During the semester (summer session)
  • Subject examined: Parallelism and concurrency
  • Lecture: 1 Hour(s) per week x 14 weeks
  • Exercises: 1 Hour(s) per week x 14 weeks
  • Practical work: 2 Hour(s) per week x 14 weeks

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