HW 3

HW 3 - CS 211- Fall 2008: Homework 3- Due October 14th, 6pm...

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

View Full Document Right Arrow Icon
CS 211- Fall 2008: Homework 3- Due October 14 th , 6pm Ques 1. For the following code fragment, assume that all data references are shown, that all values are defined before use, and that only b and c are used again after this segment. You may ignore any possible exceptions. The individual statements are numbered to provide an easy reference . 1 . if (a > c } ( 2 . d = d + 5 ; 3 . a= b + d +e {; { else } 4 . e = e + 2 ; 5 . f = f + 2 ; 6 . c = c + f ; { 7 . b = a + f ; ) a) List the control dependencies in the code. For each control dependence, tell whether the dependent statement can be scheduled before the if statement based on the data references . ) b) Assume a dynamically scheduled multiple-issue processor without speculation and with a window (i.e., scope of ILP) that is holding the entire code fragment. Find the data dependencies and use this information to make a list of the successive groups of statements that are issued together .
Background image of page 1

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

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This document was uploaded on 02/08/2012.

Page1 / 3

HW 3 - CS 211- Fall 2008: Homework 3- Due October 14th, 6pm...

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

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