Question $6$

Suppose you have a RISC machine with a $2\mathrm{.}8$ GHz clock $($i$.$e$.,$ the clock ticks $2\mathrm{.}8$ billion times per second$).$ This particular computer uses an instruction cache, a data cache, an operand fetch unit, and an operand

store unit. The instruction set includes simple instructions with the following timings:

Assume that the following code fragment is used to sum the element of a numeric array.SET reg$2,$ MAX$\_$SIZE ;initialize loop counter

SET reg$3,$ @list ;initialize array pointer

$\_$ProcessArray:

LOAD reg$4,[$reg$3]$ ;fetch current list element

ADD reg$1,$ reg$4$ ;add current list element

ADD reg$3,4$ ;move array pointer to next element

LOOP $\_$ProcessArray ;auto$-$decrement reg$2,$ jump to more if reg$2$

eq $0$If the initialization code has already executed $($i$.$e$.$ the SET instructions have already finished execution$)$ how many array elements can be processed in $4\mathrm{.}3$ milliseconds $($ms$)?$ Round your answer to the nearest

integer. Recall that $1ms=0\mathrm{.}001$ seconds. Also assume that there are no physical memory limitations$,$ implying that the array can be as large as desired.