DF00100 Advanced Compiler Construction

(PhD course, 9hp, spring 2021)

The presentations will be given on 24 March 2021 on the course's zoom channel. The presentation day will start at 09:00 (sharp) with a guest lecture.

ASSIGNED PAPERS FOR STUDENT PRESENTATIONS

Preliminary presentation order:
(max. 30 minutes presentation, then opposition and questions by all)

• 09:00 Guest lecture
• ca. 10:15 Viktor
• ca. 11:00 Mikael
• (IDA staff meeting / lunch break)
• 13:30 August
• ca. 14:10 John
• ca. 14:50 Ali
• (ca. 15:30 short break)
• 15:45 Frans
• ca. 16:25 Filip

Loop Optimizations

• Bo Qiao, Oliver Reiche, Frank Hannig, Jürgen Teich:
  From loop fusion to kernel fusion: a domain-specific approach to locality optimization
  CGO 2019: Proc. IEEE/ACM International Symposium on Code Generation and Optimization, February 2019, pages 242-253.
  Presenter: August. Opponent: Mikael
• R. Rocha et al.:
  Vectorization-aware loop unrolling with seed forwarding.
  CC 2020: Proc. 29th International Conference on Compiler Construction, February 2020, pages 1-13.
  Presenter: Mikael. Opponent: Viktor
• Lorenzo Chelini, Tobias Gysi, Tobias Grosser, Martin Kong, Henk Corporaal:
  Automatic Generation of Multi-Objective Polyhedral Compiler Transformations. PACT 2020: 83-96.
  Presenter: John. Opponent: Frans
• T. Teixeira, C. Ancourt, D. Padua, W. Gropp:
  Locus: a system and a language for program optimization.
  Proc. IEEE/ACM International Symposium on Code Generation and Optimization (CGO 2019). IEEE Press, 217-228.
  Presenter: Ali. Opponent: Filip
• T. Edler von Koch, S. Manilov, C. Vasiladiotis, M. Cole, B. Franke.
  Towards a compiler analysis for parallel algorithmic skeletons.
  Proc. 27th International Conference on Compiler Construction (CC 2018). Association for Computing Machinery, New York, NY, USA, 174-184.
  Presenter: Frans. Opponent: August

DSL Compilation

• W. Moses, V. Churavy:
  Instead of Rewriting Foreign Code for Machine Learning, Automatically Synthesize Fast Gradients.
  Proc. NeurIPS 2020.
  Presenter: Viktor. Opponent: Ali

Target Code Generation:

• G. Hjort Blindell, M. Carlsson, R. Castañeda Lozano, Christian Schulte:
  Complete and Practical Universal Instruction Selection.
  ACM Trans. Embed. Comput. Syst. 16, 5s, Article 119 (October 2017), 18 pages.
  Presenter: Filip. Opponent: John

Instructions

Prepare a presentation of about 25 minutes of your paper chosen for presentation, and three good questions about the paper you are opponent for. Finally, send a written summary of your presented paper (using your own words) of about 2 pages to the examinator.
All moments must be passed to get the credits for the presentation.

Note: Your presentation will be stopped after 25 minutes. Hence, avoid having more than 15-20 slides (unless you need more for animations), avoid having too much text and use pictures instead where appropriate.
Focus on the most important contributions - what is it that we should keep in mind from your presentation?

Send me your complete slides at least one day before the presentation for approval. No draft versions, please!
If you do not get any feedback, you can assume that the slides are basically OK.

Note: You can (and should) be critical to the approach taken in the paper. Distinguish between your opinion and that of the authors.

After the presentation, please send me a 2 pages summary of the paper with your own words by 6 April.
In the conclusion of your presentation and in your summary text, you should also consider the question what you would do differently or try next if this were your research project.

Page responsible: Webmaster
Last updated: 2021-03-08