Suppose that you are working with a CISC machine using a 2.5 GHz clock (i.e., the clock ticks 2.5 billion times per second). This particular computer uses MASM-like instructions with the following timings: ADD reg, mem ; 7 clock cycles (i.e., the ADD micro-program has 7 instructions) ADD reg, immed ; 4 clock cycles LOOP _LabelName; 6 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. MOV BX, 0 MOV ECX, MAX SIZE MOV ESI, OFFSET list _ProcessArray: ADD BX, [ESI] ESI, 2 ADD LOOP ProcessArray ;initialize sum ;initialize LOOP counter ;initialize array pointer ; Add current list element ; Move array pointer to next element ; auto-decrement ECX, jump to more if ECX = 0 After initialization, how many array elements can be processed in 3.1 millisecond (ms)? Round your answer to the nearest integer. Note that 1 ms = 0.001 second.

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
Suppose that you are working with a CISC machine using a 2.5 GHz clock (i.e., the clock ticks 2.5
billion times per second). This particular computer uses MASM-like instructions with the following
timings:
ADD reg, mem ; 7 clock cycles (i.e., the ADD micro-program has 7 instructions)
ADD reg, immed ; 4 clock cycles
LOOP Label Name ; 6 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.
MOV
BX, 0
ECX, MAX SIZE
MOV
MOV ESI, OFFSET list
_ProcessArray:
ADD
AD
LOOP
BX, [ESI]
ESI,
_ProcessArray
;initialize sum
; initialize LOOP counter
; initialize array pointer
;Add current list element
; Move array pointer
next element
; auto-decrement ECX, jump to more if ECX = 0
After initialization, how many array elements can be processed in 3.1 millisecond (ms)? Round your
answer to the nearest integer. Note that 1 ms = 0.001 second.
Transcribed Image Text:Suppose that you are working with a CISC machine using a 2.5 GHz clock (i.e., the clock ticks 2.5 billion times per second). This particular computer uses MASM-like instructions with the following timings: ADD reg, mem ; 7 clock cycles (i.e., the ADD micro-program has 7 instructions) ADD reg, immed ; 4 clock cycles LOOP Label Name ; 6 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. MOV BX, 0 ECX, MAX SIZE MOV MOV ESI, OFFSET list _ProcessArray: ADD AD LOOP BX, [ESI] ESI, _ProcessArray ;initialize sum ; initialize LOOP counter ; initialize array pointer ;Add current list element ; Move array pointer next element ; auto-decrement ECX, jump to more if ECX = 0 After initialization, how many array elements can be processed in 3.1 millisecond (ms)? Round your answer to the nearest integer. Note that 1 ms = 0.001 second.
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Properties of Different Architectures
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
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education