Question: See image first. Before running the code, assume that the FC registers of interest contain the following values: $ 2 : 0 x 1 $
See image first.
Before running the code, assume that the FC registers of interest contain the following values:
$: x
$: xfffffff
$: x
$: xfa
$: x
$: x
$: xab
$:
$: xcb
$:
$:x
and the memory locations referenced by the code contain:
mem:
mem:
mem:
mem:
mem:
mem:
mem:
mem:
mem:
mem: Oxffffffc
mem:
mem:
mem:
mem:
mem: Oxe
mem: Oxffffffff
mem:
mem:
mem:
mem:
mem:
mem:
Also, the DPU is empty and the control signals, as well as all history bits of the branch predictor subunit,
are set to zero. Assume that the addresses of the branch instructions do not conflict in accessing the
history memory and destination addresses. Show how the code is executed in the above NET, as
follows:
A Give the single timing diagram resulting from the run, based on the register and memory values listed
above.
B Provide all values generated within the DPU, either as data or control signals, separately for each
machine cycle, from the recall phase of the first instruction, to the result storage phase of the last
instruction. For this purpose, use the shown datapath, duplicating it as many times as needed, creating
in each empty DPU a snapshot of a machine cycle, placing on each the requested signal and data values.
Hint: In this exercise the flow of register and memory values results in three iterations.Consider MIPS DPU of partially overlapping instructions, with pipelining and branch prediction.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
