A computer hardware as the following latency for its instructions in Pico seconds: Type Instruction Memory Register Read ALU Operation Data Memory Register Write Total R-Format 250 150 200 0 20 620 lw 250 150 200 250 20 870 sw 250 150 200 250 0 850 beq 250 150 200 0 0 600 J 250 0 0 0 0 250   For a single-cycle implementation what Clock Rate does the machine needs to operate at?   For a multi-cycle implementation what Clock Rate does the machine needs to operate at?

Systems Architecture
7th Edition
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Stephen D. Burd
Chapter4: Processor Technology And Architecture
Section: Chapter Questions
Problem 26VE: _____ is a CPU design technique in which instruction execution is divided into multiple stages and...
icon
Related questions
Question

 

  • You must show all work for every problem that requires it.
  • The point values for problems may be changed at the professor's discretion. 
  • Read each question carefully and follow the instructions. 

 

 

 

 

  1. A computer hardware as the following latency for its instructions in Pico seconds:
Type Instruction Memory Register Read ALU Operation Data Memory Register Write Total
R-Format 250 150 200 0 20 620
lw 250 150 200 250 20 870
sw 250 150 200 250 0 850
beq 250 150 200 0 0 600
J 250 0 0 0 0 250

 

  1. For a single-cycle implementation what Clock Rate does the machine needs to operate at?

 

  1. For a multi-cycle implementation what Clock Rate does the machine needs to operate at?

 

 

 

 

 

 

 

 

 

 

 

 

  1.  
  2.  Provide the type, assembly language instruction and binary representation of instructions described by the following MIPS fields:
  • Op=0x0, rs=3, rt=2, rd=3, shamt=0, funct=34
  • Op=0x23, rs=3, rt=1, const=0x4

 

 

 

 

  1. In the snippet of assembly code below, how many times is instruction memory accessed? How many times is data memory accessed? (Count only accesses to memory, not registers.) 

lw $v1, 0($a0) 

addi $v0, $v0, 1

sw $v1, 0($a1) 

addi $a0, $a0, 1 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  1. Consider the following instruction:

SW Rt , Rd(Rs)

Interpretation: Reg[Rt] = Mem[Reg[Rd] + Reg[Rs]]

 

What are the values of the control signals generated by the control in the fig above?

RegDest Jump Branch MemRead MemtoReg ALUop MemWrite ALUSrc RegWrite
                 

 

 

 

 

 

 

 

 

 

  1.  Highlight the Datapath that would be used in an ADD Immediate instruction

Example: ADDI s0, s0, Imm

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  1.  List and describe the stages of the classical MIPS pipeline?

 

 

 

 

 

 

 

 

 

 

 

 

 

  1.  Consider a 10 billion instruction program, consisting of 20% loads, 20% stores, and 60% other instructions. Will this program run faster on processor A or processor B?
    • Processor A: A 200 MHz single cycle processor.
    • Processor B: A 1000MHz multi-cycle processor on which
      • loads take 10 cycles;
      • stores take 8 cycles; and
      • all other instructions take 4 cycles.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  1. How many cycles are required to run the following code on a Single cycle MIPS processor? Calculate the CPI of the program?

ADDI $t1, $t1, 1

ADDI $t2, $t2, 4

ADDI $s0, $0, 16

while:   

BEQ $s0, $0, Done

ADDI $s0, $s0, -1

J while

Done

 

 

 

 

 

 

 

 

 

 

 

  1.  How many cycles are required to run the following code on a multicycle MIPS processor? Calculate the CPI of the program?

ADDI $s0, $0, 5

while:   

BEQ $s0, $s0, Done

ADDI $s0, $s0, -1

J while

Done:

 

 

 

 

 

 

 

 

 

 

  1.  Please list and define the three types of pipeline hazards that exist. Also, for each of the hazards, list at least one method of reducing the number of occurrences of the hazard.

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

 

  1.  For the code sequence below, state whether it must stall, can avoid stalls using only forwarding, or can execute without stalling or forwarding.

i1: addi $t1, $t0, 1 

i2: addi $t2, $t1, 2

i3: addi $t3, $t0, 2 

i4: addi $t4, $t0, 4 

i5: addi $t4, $t3, -1 

i6: beq $t0, $0, end 

end:

  • Which lines in the program would require stalls based on data dependencies
  • Reorder the program so that no stalls are required.
    •  
Expert Solution
steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Fundamentals of Computer System
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
  • SEE MORE QUESTIONS
Recommended textbooks for you
Systems Architecture
Systems Architecture
Computer Science
ISBN:
9781305080195
Author:
Stephen D. Burd
Publisher:
Cengage Learning
Programming Logic & Design Comprehensive
Programming Logic & Design Comprehensive
Computer Science
ISBN:
9781337669405
Author:
FARRELL
Publisher:
Cengage