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 ;initialize sum 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 current list element ADD reg3, 4 ;move array pointer to next element 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.
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 ;initialize sum 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 current list element ADD reg3, 4 ;move array pointer to next element 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.
Computer Networking: A Top-Down Approach (7th Edition)
7th Edition
ISBN:9780133594140
Author:James Kurose, Keith Ross
Publisher:James Kurose, Keith Ross
Chapter1: Computer Networks And The Internet
Section: Chapter Questions
Problem R1RQ: What is the difference between a host and an end system? List several different types of end...
Related questions
Question
very very very very strict warningggg dont dont dont answer posting so so so many multiple timesss dont dont waste mmy question will send multiple dislikesssssssss sure strict compliant to bartleby admin team dont dare to waste my question dont answer!!!!!!!!!!!!
![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
;initialize sum
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 current list element
ADD reg3, 4
;move array pointer to next element
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.](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2Fe96efeec-57f3-452f-9dee-122379098156%2Faab00be8-5d71-4cbe-a83f-7f4d0d605b86%2Fkqjbtal_processed.jpeg&w=3840&q=75)
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
;initialize sum
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 current list element
ADD reg3, 4
;move array pointer to next element
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.
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Computer Networking: A Top-Down Approach (7th Edi…
Computer Engineering
ISBN:
9780133594140
Author:
James Kurose, Keith Ross
Publisher:
PEARSON
Computer Organization and Design MIPS Edition, Fi…
Computer Engineering
ISBN:
9780124077263
Author:
David A. Patterson, John L. Hennessy
Publisher:
Elsevier Science
Network+ Guide to Networks (MindTap Course List)
Computer Engineering
ISBN:
9781337569330
Author:
Jill West, Tamara Dean, Jean Andrews
Publisher:
Cengage Learning
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY