Semester : SEMESTER 2
Subject : Parallel Computer Architecture
Year : 2018
Term : DECEMBER
Branch : COMPUTER SCIENCE AND ENGINEERING
Scheme : 2015 Full Time
Course Code : 01 CS 6102
Page:1
No. of Pages: 2
API ABDUL KALAM TECHNOLOGICAL UNIVERSITY
SECOND SEMESTER M.TECH DEGREE EXAMIN ATION, DECEMBER 2018
Branch: COMPUTER SCIENCE & ENGINEERING
Stream : Computer Science & Engineering
01CS6102:PARALLEL COMPUTER ARCHITECTURE
Answer any twofull questions from each part
Limit answers to the required points.
Max. Marks: 60 Duration: 3-heduf
PARTA
1. ३. Explain Flynn's taxonomy of parallel computers.
b. Show how the following code would look like in MIPS when Loop Unrolled and [5]
Scheduled
Loop: {> FO,0(R1)
ADD.D 2
5.೧ F4,0(R1)
DADDUI R1,R1,#-8
BNE R1,R2,Loop
2. a. What do you understand by correlating branch predictors. [21
b. Consider the following MIPS code sequence that increments a vector of values 151 in
memory (starting at O(RI) and with the last element at 8(R2)) by a scalar in register F2.
Enlist any dependency if present.
Loop: L.D F0,0(R1) ;FO=array eleme element
2.7 F4,F0,F2 jadd scalar in io ADD.D
F4,0(R1) jstore result SD
DADBPTRLR1,#-8 ;decrement poi
RNERLRZLOOP ಲ 72 அண்
c. Define Amdahl's law.
3. ௨ We want to replace the processor used for Web processing. Assuming that the [5]
original processor is busy with computation 40% of the time and is waiting for I/0 60% of
the time. If the overall speedup gained by incorporating the enhancement is 1.5625, how
much faster would be the new processor on computation in the web servicing application
than the original processor.
b. Write notes on different type of dependences.