583f11_exam_solutions

583f11_exam_solutions - Q1. Yes. Availablility is a must...

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

View Full Document Right Arrow Icon
Q1. Yes. Availablility is a must relation while reaching is a may relation, thus any definition that is available will always be reaching. Q2. False. Not if it is conditionally executed and might cause an exception. Or, if the instruction conditionally over writes a live out, then LICM may also not be possible. Q3. Yes. The Lstart time represents the latest an instruction can be scheduled and still obtain the “best” or infinite resource schedule length. But, schedules are often not the best due to resource constraints, thus instructions will be scheduled after their Lstart time. Q4. For loop count N total cycles = N*II + (SC-1)*II For large N, loops with smaller II will finish in fewer cycles, thus (a) will require fewer cycles. Q5. Memory instructions, particularly loads, because these take longer time and initiating these earlier enables more compact schedules to be achieved.
Background image of page 1

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

View Full DocumentRight Arrow Icon
Q6: Q7: K = {-1, +1, -3, -4, {+3, +4}} → 5 unique control dependences so 5 predicates are required
Background image of page 2
p1 = cmpp.UN(cond1_bar) if T p2 = cmpp.UN(cond_3) if p1 p3 = cmpp.UN(cond_4) if p2 Q.8
Background image of page 3

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

View Full DocumentRight Arrow Icon
Background image of page 4
Image of page 5
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 / 7

583f11_exam_solutions - Q1. Yes. Availablility is a must...

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

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