Suppose that you are working with a CISC machine using a 2.7 GHz clock (i. e., the clock ticks 2.7 billion times per second). This particular computer uses MASM-like instructions with the following timings: ADD reg, mem ; 6 clock cycles (i. e., the ADD micro-program has 6 instructions)
ADD reg, immed ; 3 clock cycles
LOOP _LabelName ; 8 clock cycles
Suppose that the following code fragment is used to sum elements of a numeric array. For this problem, assume that memory limitations are non-existent and that there is no limit to the size of the array.
ov bx, 0 ;initialize sum
mov ecx, MAX_SIZE ;initialize loop counter
mov esi, OFFSET list ;initialize array pointer
more:
add bx, esl
[
esi
]
;add current list element
add esi, 2 ;move array pointer to next element
loop more ;auto-decrement ecx, jump to more if ecx ≠ 0
After initialization, how many array elements can be processed in 2.8 ms? Round your answer to the nearest integer. Note that 1 ms. = 0.001 second.