The goal of this course is to introduce students to the fundamental theoretic and practical principals of concurrency, with emphasis on the correctness, design and implementation of models of concurrent computation using shared memory architectures.

• The 1st part of the course is more fundamental and is given by Nelma Moreira. More information here.
• This 2nd part of the course will focus on the programming aspect, using the Scala language to study several concurrency patterns and libraries in Java Virtual Machines.
• Other links:
  • Moodle: management of the presence of students and other links;
  • Sigarra@FCUP: the official plan of this course.

Lectures

• 27 Mar 25: [T] Introduction to the second module (1-intro.pdf). Overview of Scala (2-scala.pdf).
  [P] Exercises on Scala (ex-scala.pdf).
• 3 Apr 25: [T] Introduction to the Java Memory Model (3-javamemory.pdf, slides 1-26).
  [P] Exercises on the Java Memory Model (ex-javamemory.pdf).
• 24 Apr 25 (planned): [T] Waiting and notifying; Graceful shutdown (3-javamemory.pdf, slides 28-end). Executors and ExecutionContext; atomic variables (4-concblocks.pdf).
  [P] Continuation of exercises on the Java Memory Model with waiting states (ex-javamemory.pdf); Execution contexts (ex-concblocks.pdf).

Literature and Material

Slides

1. Introduction to the second module
2. Scala primer
3. Java Memory Model
4. Basic building blocks of concurrency

Exercises

1. Exercises on Scala
2. Exercises on Java Memory
3. Exercises on building blocks of concurrency

Examples of exams and tests

• 2023-2024 - Test for the second module (at época normal)
• 2018-2019 - Test for the first module (authentication needed - during the semester)

### Assignment

• Practical assignment on Concurrent Programming 2024/25
• Chose your group via Moodle - there should be two people in each group.

Main book

• Learning Concurrent Programming in Scala, Aleksandar Prokopec; ISBN: 1786466899

Previous years

• (2023/24): https://fm-dcc.github.io/pc2324
• (2018/19): https://www.dcc.fc.up.pt/~nam/Teaching/procon20/

Teaching methods and learning activities

Lectures; intermediate test (mandatory) and final test or final exam.

The lectures mix the presentation of new material (introducing concepts, main algorithms and some results) with interactive discussion of their application when solving real problems.

The homework focus is on practical application of algorithmic concepts, consolidating the learned material.

The final exam and intermediate tests (closed book), globally evaluates the knowledge acquired by the students.

Evaluation Type

Distributed evaluation with final exam

Assessment Components

designation	Weight (%)
Exam	70,00
Assignment	30,00

Eligibility for exams

Students must attend at least 75% of the practical classes to be admitted to the exams.

Calculation formula of final grade

Distributed evaluation will include both modelling (EM) and program implementation (EI). The final grade (FG) is obtained by weighting the distributed assessment scores and final exam (FE) as follows:

• FG = 3 * EM + 3 * EI + 14 * FE.

Lecturers

• • 
  • • Nelma Moreira
    • • DCC 1.20
      • nelma.moreira(at)fc.up.pt
      • meet: tba
• • 
  • • José Proença
    • • DCC 1.69
      • jose.proenca(at)fc.up.pt
      • meet: tba

Edit the content of this page here.