Language Abstractions for Concurrent and Parallel Programming

5 credits

Syllabus, Master's level, 1DL541

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

Entry requirements

120 credits with 60 credits in computer science, including Introduction to Parallel Programming. Functional Programming is recommended. 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:

  • write and modify programs using different models and language abstractions for concurrent and parallel programming,
  • analyse models with respect to which specific problems they address, where they can be used and where they should be avoided,
  • explain the difference between a model and its implementation in a specific language,
  • explain how some languages implement hybrids or multiple models and how these can interact.


Some different models for concurrency and parallel programming, e.g., transactional memories, actors, side-effect-free combinators and map-reduce. Implementation and use of these models in different programming languages, such as C++, Java, Erlang. Strengths and weaknesses of the models.

Closer study of a model and its implementation in some language to be used as a basis for comparisons between models.


Lectures, labs, tutoring.


Oral and written assessment of assignments.

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.

Other directives

The course cannot be included in the same degree as 1DL540.

No reading list found.