MidtermSpring2010 - EEL 4930/5934 Reconfigurable Computing...

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

View Full Document Right Arrow Icon
EEL 4930/5934 Reconfigurable Computing Midterm Exam – Spring Semester 2010 Name ___________________________________ 1 1. Systolic Architecture ( a) Given the following algorithm in pseudo-code, draw a datapath that is fully-pipelined and with the maximum loop-unrolling. for (i=1; i < 10000; i++) { z[i] = avg(a[i-1] + a[i] + a[i+1]); } Assume the memory bandwidth is 64 bits and data items are 16 bits. ( b) Calculate the speedup of the above circuit (assuming the FPGA clock rate of 200 MHz) as compared to the corresponding software executing on a microprocessor (assume 15 instructions for each iteration, a CPI of 2, and clock frequency of 3 GHz). ( c) Using the same assumptions as above except the memory bandwidth is increased to 128 bits, calculate the speedup of the resulting circuit (using the maximum amount of loop unrolling) as compared to the corresponding software executing on a microprocessor. 18 pts.
Background image of page 1

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

View Full DocumentRight Arrow Icon
EEL 4930/5934 Reconfigurable Computing Midterm Exam – Spring Semester 2010 Name ___________________________________ 2 2. Smart Buffer This problem makes use of the algorithm (pseudo code) and the systolic architecture of Problem 1, but with the following design and assumptions. Assumptions : Memory bandwidth is 32 bits. Data item are 8 bits. However, we want the bandwidth into the datapath to be 48 bits. For that reason, a smart buffer is used. This smart buffer is similar to the one explained in class. The difference is that this smart buffer only uses 6 bytes (instead of the 8-byte one in class). p15 p16 p17 p18 p11 p12 p13 p14 p7 p8 p9 p10 p3 p4 p5 p6 xx xx p1 p2 addr 6 5 4 3 2 1 0 Input BRAM etc. etc. Smart Buffer 32 48 Datapath (a) Specify the contents of the smart buffer after each of the following clock cycle. after clock cycle 1 after clock cycle 2 after clock cycle 3 after clock cycle 4 (b) Briefly describe what happens at each clock cycle. Keep the algorithm as uniform as possible.
Background image of page 2
Image of page 3
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 03/27/2012 for the course EEL 4930 taught by Professor Staff during the Spring '08 term at University of Florida.

Page1 / 9

MidtermSpring2010 - EEL 4930/5934 Reconfigurable Computing...

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

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