Session 07 is about how you design a parallel algorithm, so these are interactive concept demos, not code files. Open them full-screen and show them live in class.
▶ Open the Interactive SlidesTake one job and toggle between data decomposition (same op, split the data) and functional/pipeline decomposition (different ops). Slide the worker count and watch the split.
A dependency DAG where tasks light up as they finish. Independent tasks run together; the glowing chain is the critical path — the hard ceiling on speedup. Shows work, span, and max speedup.
No installs, no compilers — these run in any modern browser. The critical-path idea here becomes Amdahl's Law in Session 08, and real OpenMP / MPI / CUDA code starts in Unit IV.