Program Optimization (IN2053)
| Lecturer (assistant) | |
|---|---|
| Number | 0240795803 |
| Type | lecture with integrated exercises |
| Duration | 6 SWS |
| Term | Winter semester 2026/27 |
| Language of instruction | English |
| Position within curricula | See TUMonline |
| Dates | See TUMonline |
- 14.10.2026 10:00-12:00 00.13.009A, Seminarraum
- 14.10.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 15.10.2026 10:00-12:00 00.13.009A, Seminarraum
- 20.10.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 21.10.2026 10:00-12:00 00.13.009A, Seminarraum
- 21.10.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 22.10.2026 10:00-12:00 00.13.009A, Seminarraum
- 27.10.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 28.10.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 29.10.2026 10:00-12:00 00.13.009A, Seminarraum
- 03.11.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 04.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 04.11.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 05.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 10.11.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 11.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 11.11.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 12.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 17.11.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 18.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 18.11.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 19.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 24.11.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 25.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 25.11.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 26.11.2026 10:00-12:00 00.13.009A, Seminarraum
- 01.12.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 02.12.2026 10:00-12:00 00.13.009A, Seminarraum
- 02.12.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 08.12.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 09.12.2026 10:00-12:00 00.13.009A, Seminarraum
- 09.12.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 10.12.2026 10:00-12:00 00.13.009A, Seminarraum
- 15.12.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 16.12.2026 10:00-12:00 00.13.009A, Seminarraum
- 16.12.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 17.12.2026 10:00-12:00 00.13.009A, Seminarraum
- 22.12.2026 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 23.12.2026 10:00-12:00 00.13.009A, Seminarraum
- 23.12.2026 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 07.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 12.01.2027 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 13.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 13.01.2027 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 14.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 19.01.2027 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 20.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 20.01.2027 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 21.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 26.01.2027 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 27.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 27.01.2027 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 28.01.2027 10:00-12:00 00.13.009A, Seminarraum
- 02.02.2027 14:00-16:00 00.08.053, Seminarraum , Tutorial
- 03.02.2027 10:00-12:00 00.13.009A, Seminarraum
- 03.02.2027 14:00-16:00 02.07.014, Seminarraum , Tutorial
- 04.02.2027 10:00-12:00 00.13.009A, Seminarraum
Admission information
See TUMonline
Note: see https://www.in.tum.de/i02/lehre/wintersemester-1920/vorlesungen/program-optimization/
Note: see https://www.in.tum.de/i02/lehre/wintersemester-1920/vorlesungen/program-optimization/
Description
The lecture starts with basic dataflow analyses like availability of
expressions or liveness of variables together with the optimizing
transformations enabled by these analyses. Motivated by the examples, we
develop the theoretical background on complete lattices and monotone functions
necessary for program analysis methods. Subsequently, we discuss more
sophisticated analyses such as constant propagateion. By discussing interval
analysis, we present general methods for the case where ordinary fixpoint
computation will not terminate. Further topics are:
- interprocedural analysis;
- pointer analysis;
- fixpoint algorithms.
We also consider hardware dependent optimizations such as:
- register allocation;
- instruction selection;
- instruction scheduling
and also optimizations to improve the cache behavior.
expressions or liveness of variables together with the optimizing
transformations enabled by these analyses. Motivated by the examples, we
develop the theoretical background on complete lattices and monotone functions
necessary for program analysis methods. Subsequently, we discuss more
sophisticated analyses such as constant propagateion. By discussing interval
analysis, we present general methods for the case where ordinary fixpoint
computation will not terminate. Further topics are:
- interprocedural analysis;
- pointer analysis;
- fixpoint algorithms.
We also consider hardware dependent optimizations such as:
- register allocation;
- instruction selection;
- instruction scheduling
and also optimizations to improve the cache behavior.
Prerequisites
see https://www.in.tum.de/i02/lehre/wintersemester-1920/vorlesungen/program-optimization/
Teaching and learning methods
see https://www.in.tum.de/i02/lehre/wintersemester-1920/vorlesungen/program-optimization/