Hall Ticket No Question Paper Code: BCS003
INSTITUTE OF AERONAUTICAL ENGINEERING
(Autonomous)
M.Tech I Semester End Examinations (Supplementary) July, 2017
Regulation: IARE-R16
HIGH PERFORMANCE ARCHITECTURE
(Computer Science and Engineering)
Time: 3 Hours Max Marks: 70
Answer ONE Question from each Unit
All Questions Carry Equal Marks
All parts of the question must be answered in one place only
UNIT I
1. List and explain various hazards of compiling for scalar pipeline.
Using the simple procedure for dependence construct all the dependences for the loop nest below
and provide
i. direction vector(s),
ii. distance vector(s)
iii. loop level for each one.
DO K =1,100
DO J 100
DO I 100
B
ENDDO
ENDDO
ENDDO
2. Is the following example violates the Bernstein's conditions? Justify.
PARALLEL DO 1 N

ENDDO
List out preliminary transformations required to make dependence testing more accurate loop
normalization. If there is a loop carried dependence, then that loop cannot be parallelized?
Justify.
UNIT II
3. For the following example, construct valid breaking conditions.
DO I =1,100
S C
ENDDO
Page 1 of 2
Identify and define the subscripts which are ZIV, SIV and MIV from the following example.
DO I
DO J
DO K
S1 C
ENDDO
ENDDO
ENDDO
4. Explain about the goals of dependence testing?
Define conservative testing? Explain in detail with an example.
UNIT III
5. Explain generalized parallel code generation algorithm with loop shifting and recurrence breaking.

6. For the following example draw the dependence graph and generate the scalar expansion code
DO I N
S1 T
S2
S3 T
ENDDO
Explain the use of loop interchange for parallelization. What is the role of loop skewing?
UNIT IV
7. Describe how loop unroll-and-jam is used in conjunction with scalar replacement to lower the
balance of a memory-bound loop.
Distinguish between the write-through and write-back policies pointing out their merits and
demerits?
8. How Forward and Backward branch removal will be done with If-conversion.
UNIT V
9. Identify how data dependence is calculated if registers are reused and how can we improve register
reuse in loop carried and loop independent.
Write a procedure to eliminate the scalar copies in iterations.
10. The problem of scalar register allocation has essentially been solved by the register coloring
techniques? Justify.
How data dependence can affect memory hierarchy management.