Minor additions.

lectures/parallelism/slides.qmd

@@ -80,6 +80,18 @@ FIXME
    * `schedule(FIXMEsomethingelse)`
 and find out how the OpenMP runtime decomposes the problem domain.
 
+FIXME: Maybe get rid of timings here?
+FIXME: Maybe add something varying the number of threads, so that one can see
+first ideas of strong/weak scaling.
+
+# Scaling
+
+* What happens if one uses more threads, but keep the problem size?
+  * Strong scaling
+* What happens if one uses more threads, but also increases the problem size by
+  the same factor?
+  * Weak scaling
+
 # Reductions FIXME title should be more generic
 ## What is happening here?
 ```c
@@ -150,8 +162,6 @@ FIXME, if we want to do that
 * Homework:
     * Do something where you run into hardware-constraints (i.e. Numa, too many threads, ...)
     * Give some example with race condition or stuff and have them find it.
-* Add maybe:
-    * Are there theoretical concept like Amdahl, which we should explain? (I don't like Amdahl)
-    * Strong/weak scaling?
+    * Have them discuss the concepts from the lecture using the metaphor of a kitchen workflow?