Master’s studies

Syllabus for Language Abstractions for Concurrent and Parallel Programming

Programspråksabstraktioner för parallellprogrammering

  • 10 credits
  • Course code: 1DL540
  • Education cycle: Second cycle
  • Main field(s) of study and in-depth level: Computer Science A1N
  • Grading system: Fail (U), 3, 4, 5.
  • Established: 2014-03-13
  • Established by: The Faculty Board of Science and Technology
  • Applies from: week 30, 2014
  • Entry requirements: 120 credits of which at least 60 in computer science including imperative and object-oriented programming. Functional programming is recommended or can be studied in parallel with the course.
  • Responsible department: Department of Information Technology

Learning outcomes

To pass 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.

Content

Some different models for concurrency and parallel programming, e.g., threads and locks (to understand what problems other models solve), transactional memories, actors, side-effect-free combinators and map-reduce, fork/join frameworks, dataparallellism. A number of different programming languages to illustrate these models, such as C, Java, Erlang. Laboratory work that highlights 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.

Instruction

Lectures, labs, tutoring during project work.

Assessment

Oral and writen assessment of assignments, 7 credits, and project work, 3 credits.

Reading list

The reading list is missing. For further information, please contact the responsible department.