Low-Level Parallel Programming

5 credits

Syllabus, Master's level, 1DL550

Education cycle
Second cycle
Main field(s) of study and in-depth level
Computer Science A1N
Grading system
Pass with distinction, Pass with credit, Pass, Fail
Finalised by
The Faculty Board of Science and Technology, 30 August 2018
Responsible department
Department of Information Technology

Entry requirements

120 credits including 60 credits in computer science, including a second course in computer programming and programming in C. Proficiency in English equivalent to the Swedish upper secondary course English 6.

Learning outcomes

On completion of the course, the student should be able to:

  • explain key issues of parallel programming, including data distribution, load balancing, locking and synchronisation
  • construct parallel algorithms, i.e., identify parallelism in a given algorithm, implement this parallelism, and identify factors that limit the parallelism in a program or algorithm
  • compare several parallel programming frameworks in terms of performance and efficiency of development
  • use several high-performance parallel programming frameworks and choose an appropriate framework under given circumstances such as computer architecture, application and efficiency


Introduction to parallel programming and hardware. Key issues such as data distribution, load balancing, locking and synchronisation. Parallel and concurrent algorithms, factors that limit parallelism. Different parallel programming frameworks, and their pros and cons, are introduced and compared.


Lectures and seminars. Mandatory lectures may occur.


Active participation in seminars. Oral and written assessment of assignments and project.

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.

No reading list found.