Suppose you have a RISC machine with a 2.7 GHz clock (i.e., the clock ticks 2.7 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: SET reg, immed ; 3 clock cycles LOAD reg, mem ; 4 clock cycles ADD reg, reg ; 3 clock cycles ADD reg, immed ; 2 clock cycles LOOP_LabelName ; 8 clock cycles

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
100%

dont copy answers from somewhere else

I have previous answers

guaranteed dislike if does so

 

Suppose you have a RISC machine with a 2.7 GHz clock (i.e., the clock ticks 2.7 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:
SET reg, immed ; 3 clock cycles
LOAD reg, mem ; 4 clock cycles
ADD reg, reg ; 3 clock cycles
ADD reg, immed ; 2 clock cycles
LOOP _LabelName ; 8 clock cycles
Assume that the following code fragment is used to sum the element of a numeric array.
SET reg1, 0
SET reg2, MAX_SIZE ;initialize loop counter
SET reg3, @list ;initialize array pointer
ProcessArray:
LOAD reg4, [reg3] ;fetch current list element
ADD reg1, reg4
ADD reg3, 4
LOOP _ProcessArray ;auto-decrement reg2, jump to more if reg2 # 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.4 milliseconds (ms)? Round your answer to the nearest
integer. Recall that 1 ms = 0.001 seconds. Also assume that there are no physical memory limitations,
implying that the array can be as large as desired.
;initialize sum
;add current list element
;move array pointer to next element
Transcribed Image Text:Suppose you have a RISC machine with a 2.7 GHz clock (i.e., the clock ticks 2.7 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: SET reg, immed ; 3 clock cycles LOAD reg, mem ; 4 clock cycles ADD reg, reg ; 3 clock cycles ADD reg, immed ; 2 clock cycles LOOP _LabelName ; 8 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. SET reg1, 0 SET reg2, MAX_SIZE ;initialize loop counter SET reg3, @list ;initialize array pointer ProcessArray: LOAD reg4, [reg3] ;fetch current list element ADD reg1, reg4 ADD reg3, 4 LOOP _ProcessArray ;auto-decrement reg2, jump to more if reg2 # 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.4 milliseconds (ms)? Round your answer to the nearest integer. Recall that 1 ms = 0.001 seconds. Also assume that there are no physical memory limitations, implying that the array can be as large as desired. ;initialize sum ;add current list element ;move array pointer to next element
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps

Blurred answer
Knowledge Booster
Public key encryption
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.
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