Homework Help is Here – Start Your Trial Now!
Engineering
Computer Engineering
Suppose you have a RISC machine with a 2 GHz clock (e, the clock ticks 2 billion times per second). This particular computer uses an instruction a data cache, an operand fetch unit, and an operand store unit. The instruction set includes simple instructions with the following timings: cache, SET reg. ined: 2 clock cycles 13 clock cycles LOAD reg. ADD reg. reg ADD reg. ined 2 clock cycles clack cycles LOOP Label: 2 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. initialize um initiative Loop counter leitialize array pointer SET reg. SET reg2, MAX SIZE SET reg), glist ProcessArray LOAD regt, [re] ADD regl, reg ADD reg3, 4 LOOP fetch current List element current List element ve array pointer to next element ProcessArrayut-decrement reg2, jump to more if reg If the initialization code has already executed (e. the SET instructions have already finished execution) how many array elements can be processed in 4.2 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 GHz clock (e, the clock ticks 2 billion times per second). This particular computer uses an instruction a data cache, an operand fetch unit, and an operand store unit. The instruction set includes simple instructions with the following timings: cache, SET reg. ined: 2 clock cycles 13 clock cycles LOAD reg. ADD reg. reg ADD reg. ined 2 clock cycles clack cycles LOOP Label: 2 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. initialize um initiative Loop counter leitialize array pointer SET reg. SET reg2, MAX SIZE SET reg), glist ProcessArray LOAD regt, [re] ADD regl, reg ADD reg3, 4 LOOP fetch current List element current List element ve array pointer to next element ProcessArrayut-decrement reg2, jump to more if reg If the initialization code has already executed (e. the SET instructions have already finished execution) how many array elements can be processed in 4.2 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)
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...
See similar textbooks
icon
Related questions
Question

Give calculation of this.

don't provide wrong solution

Suppose you have a RISC machine with a 2 GHz clock (ie, the clock ticks 2 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, inned; 2 clock cycles LOAD reg. n ; 3 clock cycles ADD reg. rega 2 clock cycles ADD reg, inned; 1 clock cycles LOOP LabelName; 2 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. initialize sum SET regi, SET reg2, MAX SIZE SET reg), glist initialize Loop counter initialize array pointer ProcessArray: LOAD reg4, [reg)) ADD regi, reg4 reg3, 4 ADO LOOP ProcessArray fetch current List element podd current List element move arrey pointer to next element jouto-decrement reg2, jump to more if reg20 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.2 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.
Transcribed Image Text:Suppose you have a RISC machine with a 2 GHz clock (ie, the clock ticks 2 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, inned; 2 clock cycles LOAD reg. n ; 3 clock cycles ADD reg. rega 2 clock cycles ADD reg, inned; 1 clock cycles LOOP LabelName; 2 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. initialize sum SET regi, SET reg2, MAX SIZE SET reg), glist initialize Loop counter initialize array pointer ProcessArray: LOAD reg4, [reg)) ADD regi, reg4 reg3, 4 ADO LOOP ProcessArray fetch current List element podd current List element move arrey pointer to next element jouto-decrement reg2, jump to more if reg20 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.2 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
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 2 images

SEE SOLUTIONCheck out a sample Q&A here
Blurred answer
Recommended textbooks for you
Computer Networking: A Top-Down Approach (7th Edi…
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 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)
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
Concepts of Database Management
Computer Engineering
ISBN:
9781337093422
Author:
Joy L. Starks, Philip J. Pratt, Mary Z. Last
Publisher:
Cengage Learning
Prelude to Programming
Prelude to Programming
Computer Engineering
ISBN:
9780133750423
Author:
VENIT, Stewart
Publisher:
Pearson Education
Sc Business Data Communications and Networking, T…
Sc Business Data Communications and Networking, T…
Computer Engineering
ISBN:
9781119368830
Author:
FITZGERALD
Publisher:
WILEY
SEE MORE TEXTBOOKS