NMBU, INF205: Resource-efficient programming (autumn 2022)

Lecture: Wednesday, 14.00 - 16.00, TF1-102.
Datalab: Thursday, 10.00 - 12.00, TF1-105 (group #1); Thursday, 12.00 - 14.00, TF1-105 (group #2).

Team: Martin Horsch (office: TF2-303A), Jorge Hermoso.

University resources:

INF205 page on Canvas/Instructure
NMBU course catalogue entry in English and in Norsk Bokmål

Literature:

Stroustrup's "Tour of C++" is a compact book presenting modern C++ to readers with a solid background in programming. It is the main literature source for the module.

B. Stroustrup, A Tour of C++, 2nd edn., Addison-Wesley (ISBN 978-0-134-99783-4), 2018.

Supporting literature and other books that could be of interest:

R. Grimm, C++ Core Guidelines Explained: Best Practices for Modern C++, Addison-Wesley (ISBN 978-0-136-87567-3), 2022.
P. Sanders et al., Sequential and Parallel Algorithms and Data Structures, Springer (ISBN 978-3-030-25209-0), 2019.
B. Stroustrup, Programming: Principles and Practice Using C++, 2nd edn., Addison-Wesley (ISBN 978-0-321-99278-9), 2014.
B. Stroustrup, H. Sutter (eds.), C++ Core Guidelines, 2015-2022.

Glossary:

The glossary document introduces and defines selected key concepts.

Structure:

C++ basics
- Calendar week 36
  - Lecture slides (7th September 2022)
  - Tutorial worksheet (8th September 2022)
  - Textbook: Stroustrup (2018) Sections 1.2, 1.3, and 1.8
  - Literature: C. E. Leiserson et al., "There's plenty of room at the top: What will drive computer performance after Moore's law?," Science 368(6945): eaam9744, doi:10.1126/science.aam9744, 2020
  - Software: Eclipse IDE C/C++ version (install this or the previous version, but not the eclipse rpm package, which is for Java only); under Windows, try loading codeblocks-20.03mingw-setup.exe from Code::Blocks
  - Example: Prime check
- Calendar week 37
  - Lecture slides (14th September 2022)
  - Tutorial worksheet (15th September 2022)
  - Textbook: Stroustrup (2018) Sections 1.4 to 1.6, 3.2, and 3.4
  - Examples: Runtime conditions, keyword "auto", namespaces and overloading, data type size, stack frame inspection
  - Feedback and recommendations (15th September 2022)
- Calendar week 38
  - Lecture slides (21st September 2022)
  - Tutorial worksheet (22nd September 2022)
  - Textbook: Stroustrup (2018) Sections 1.7, 1.9, 2.2, 3.6
  - Examples: Runtime measurement for "prime check", struct BookIndex, pointer-use debugging (variable lifetime), memory-leak debugging, collision detection
- Calendar week 39
  - Lecture slides (28th September 2022)
  - Tutorial worksheet (29th September 2022)
  - Textbook: Stroustrup (2018) Sections 2.3, 4.5, and 10.1 to 10.4
  - Examples: Structure implementation (for collision detection), const array (← fix this code), inheritance, read from file
  - Feedback and recommendations (29th September 2022)
Data structures
- Calendar week 40
  - Lecture slides (5th October 2022)
  - Tutorial worksheet (6th October 2022)
  - Textbook: Stroustrup (2018) Sections 4.2, 9.2, 9.3, 10.5, 10.8, and Chapter 11
  - Examples: String argument passing, I/O operator overloading, sequential data structures, STL map<string, int>, STL map<string, set<int>>
- Calendar week 41
  - Lecture slides (12th October 2022)
  - Tutorial worksheet (13th October 2022)
  - Textbook: Stroustrup (2018) Sections 6.2 to 6.4 and 12.1 to 12.4
  - Project: Group formation deadline (12th October 2022)
  - Examples: Sequence performance, list template, incidence list graph
  - Feedback and recommendations (13th October 2022)
- Calendar week 42
  - Lecture slides (19th October 2022, part 1)
  - Examples: Copying and moving, node/edge deletion
Concurrency
- Calendar week 42
  - Lecture slides (19th October 2022, part 2)
  - Tutorial worksheet (20th October 2022)
  - Literature: M. J. Flynn, "Some computer organizations and their effectiveness," IEEE Trans. Comput. C21(9): 940-960, doi:10.1109/tc.1972.5009071, 1972
  - Documentation (MPI): Open MPI v4.1.4 documentation
  - Example: MPI-parallel counting of primes
- Calendar week 43
  - Lecture slides (26th October 2022)
  - Project (more information here):
    - Group work and discussion of project topics; start: 27th October 2022
    - Group status report (mandatory); deadline: 31st October 2022
  - Examples: MPI ping-pong (send and receive), collective communication, unit vector (incomplete code)
  - Feedback and recommendations (27th October 2022)
- Calendar week 44
  - Lecture slides (2nd November 2022)
  - Project group status (mandatory); deadline: 7th November 2022
  - Literature: R. Wiśniewski et al., "C-exact hypergraphs in concurrency and sequentiality analyses of cyber-physical systems specified by safe Petri nets," IEEE Access 7: 13510-13522, doi:10.1109/access.2019.2893284, 2019
  - Documentation: Connecting to Orion (VPN access only), scheduler commands, ROS: Robot Operating System, implementing a ROS2 node, OpenMP reference card
  - Software: PIPE Petri net simulator version 4 or version 5
  - Examples: SLURM job script, ROS nodes, OpenMP-parallel counting of primes (and variant using "threadparallel" and padding), Petri nets: Intro example, Wiśniewski's scenario (XMLs for PIPE)
Production
- Calendar week 45
  - Lecture slides (9th November 2022)
  - Project group status (mandatory): Confirm or reschedule your presentation date; deadline: 14th November 2022
  - Examples: Disks to pixels, directed-graph querying, periodic boundary condition
- Calendar week 46
  - Lecture slides (16th November 2022)
  - Project group status (mandatory); deadline: 21st November 2022
  - Benchmark: Pixel/vector graphics generator (and benchmark series of figures), graph generator, sphere configuration generator
  - Documentation: Magick++ API (ImageMagick), CMake Reference Documentation
  - Examples: Shared library, small graph (15 nodes), CMake project
Parallel data
- Calendar week 47
  - Lecture slides (23rd November 2022)
  - Project group status (mandatory); deadline: 28th November 2022
  - Literature:
    - A. Skjellum, D. Schafer, "Checkpoint-restart libraries must become more fault tolerant," arXiv:2112.10814 [cs.DC], 2021
    - N. Tchipev et al., "TweTriS: Twenty trillion-atom simulation," Int. J. HPC Appl. 33(5): 838-854, doi:10.1177/1094342018819741, 2019
  - Documentation: MPI standard version 4.0 (see Chapter 14)
  - Examples: 2D domain decomposition (charmap output), 3D domain decomposition (particle configuration), stream-based communication, MPI-IO demo
- Calendar week 48
  - Lecture slides (30th November 2022)
  - Literature:
    - V. Bilsen et al., Study on Greening Cloud Computing and Electronic Communications Services and Networks, technical report, EU publications office, doi:10.2759/116715, 2022
    - S. Seckler et al., "AutoPas in ls1 mardyn: Massively parallel particle simulations with node-level auto-tuning," J. Computat. Sci. 50: 101296, doi:10.1016/j.jocs.2020.101296, 2021
    - S. Shudler et al., " Understanding the scalability of molecular simulation using empirical performance modeling," in Proc. ESPT/VPA 2017/18, pp. 125-143, doi:10.1007/978-3-030-17872-7_8, Springer, 2019
Project presentations
- Calendar week 48: Image compression, neural networks, graph querying (schedule)
- Calendar week 49: Spherical particle configurations and other topics (schedule)
- Calendar week 50: Image compression and other topics (schedule)

Programming project:

See more information here.

Projects should be done by groups of three participants jointly; groups of two are also possible.

Coding group work is carried out from week 43 to week 48. Mandatory presentation and discussion are held in weeks 48, 49, and 50.

License:

The code examples from this module are released by NMBU REALTEK's Institutt for datavitenskap under the conditions of the Creative Commons BY-NC-SA 4.0 License (attribution, non-commercial, share-alike).

Index