Midterm Examination2000

Midterm Examination2000 - Name Solution Computer...

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

View Full Document Right Arrow Icon

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

View Full DocumentRight Arrow Icon

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

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

Unformatted text preview: Name Solution Computer Architecture EE 4720 Midterm Examination, Part I Monday, 16 October 2000, 12:4013:30 CDT Alias Lets go Mets!! Problem 1 (17 pts) Mon. Problem 2 (17 pts) Mon. Problem 3 (16 pts) Mon. Problem 4 (13 pts) Wed. Problem 5 (17 pts) Wed. Problem 6 (20 pts) Wed. Exam Total (100 pts) Good Luck! Problem 1: The program below executes on the pipeline below as illustrated in the pipeline execution diagram below. Bypass paths do not appear in the illustration (below). sign ext. IR Addr 6..10 11..15 IR IF ID EX WB MEM IR IR A B IMM NPC ALU =0 Addr Data Addr D In +4 PC Mem Port Addr Data Addr In Mem Out B ALU MD Data NPC Control Logic RD RD RD 3 4 3 7 8 ! Cycle 1 2 3 4 5 6 7 8 9 10 11 andi r8, r8, #31 IF ID EX ME WB add r10, r9, r8 IF ID EX ME WB bnez r8, LINEX IF ID EX ME WB jalr r10 IF ID EX ME WB xor IFx ... subi r31, r31, #8 IF ID EX ME WB sw 0(r10), r31 IF ID EX ME WB ! Cycle 1 2 3 4 5 6 7 8 9 10 11 checked [10 pts] Add exactly those bypass paths that are needed so that the code (above) executes as shown. Credit will be deducted for unneeded bypasses. Please, please, please check the code carefully for dependencies. The bypass paths are shown in red bold . checked [7 pts] Next to each bypass path indicate the cycle(s) in which it will be used. The cycle numbers are shown in blue . 2 Problem 2: As described in class, postincrement instruction lw r1,(r2+) loads the value at memory address r2 into register r1 and stores r2+4 in r2 . Postincrement stores are similar. The pipeline below is to be modified so that it can execute postincrement loads and stores for bytes, half words, and words. A logic block size can be used; its input is the opcode and func fields; the output is 0 for a postincrement with a byte-size load or store value, 1 for a postincrement with a half-word value, 2 for a postincrement with a word-size value, and 3 if the instruction is not a postincrement load or store....
View Full Document

Page1 / 8

Midterm Examination2000 - Name Solution Computer...

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

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