583L17 - EECS 583 Class 17 Research Topic 1 Decoupled...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
EECS 583 – Class 17 Research Topic 1 Decoupled Software Pipelining University of Michigan November 9, 2011
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
- 1 - Announcements + Reading Material 2 nd paper review due today » Should have submitted to andrew.eecs.umich.edu:/y/submit Next Monday – Midterm exam in class Today’s class reading » “Automatic Thread Extraction with Decoupled Software Pipelining,” G. Ottoni, R. Rangan, A. Stoler, and D. I. August, Proceedings of the 38th IEEE/ACM International Symposium on Microarchitecture , Nov. 2005. Next class reading (Wednes Nov 16) » “Spice: Speculative Parallel Iteration Chunk Execution,” E. Raman, N. Vachharajani, R. Rangan, and D. I. August, Proc 2008 Intl. Symposium on Code Generation and Optimization , April 2008.
Background image of page 2
- 2 - Midterm Exam When: Monday, Nov 14, 2011, 10:40-12:30 Where » 1005 EECS Uniquenames starting with A-H go here » 3150 Dow (our classroom) Uniquenames starting with I-Z go here What to expect » Open book/notes, no laptops » Apply techniques we discussed in class on examples » Reason about solving compiler problems – why things are done » A couple of thinking problems » No LLVM code » Reasonably long but you should finish Last 2 years exams are posted on the course website » Note – Past exams may not accurately predict future exams!!
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
- 3 - Midterm Exam Office hours between now and Monday if you have questions » Daya: Thurs and Fri 3-5pm » Scott: Wednes 4:30-5:30, Fri 4:30-5:30 Studying » Yes, you should study even though its open notes Lots of material that you have likely forgotten Refresh your memories No memorization required, but you need to be familiar with the material to finish the exam » Go through lecture notes, especially the examples! » If you are confused on a topic, go through the reading » If still confused, come talk to me or Daya » Go through the practice exams as the final step
Background image of page 4
- 4 - Exam Topics Control flow analysis » Control flow graphs, Dom/pdom, Loop detection » Trace selection, superblocks Predicated execution » Control dependence analysis, if-conversion, hyperblocks » Can ignore control height reduction Dataflow analysis » Liveness, reaching defs, DU/UD chains, available defs/exprs » Static single assignment Optimizations » Classical: Dead code elim, constant/copy prop, CSE, LICM, induction variable strength reduction » ILP optimizations - unrolling, renaming, tree height reduction, induction/accumulator expansion » Speculative optimization – like HW 1
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
- 5 - Exam Topics - Continued Acyclic scheduling » Dependence graphs, Estart/Lstart/Slack, list scheduling » Code motion across branches, speculation, exceptions Software pipelining » DSA form, ResMII, RecMII, modulo scheduling
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 12/26/2011 for the course EECS 583 taught by Professor Flinn during the Fall '08 term at University of Michigan.

Page1 / 39

583L17 - EECS 583 Class 17 Research Topic 1 Decoupled...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online