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 instructioncache, 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 cyclesLOAD reg.; 3 clock cyclesADD reg, reg ; 2 clock cyclesADD reg, inned; 1 clock cyclesLOOP LabelName; 2 clock cyclesAssume that the following code fragment is used to sum the element of a numeric array.initialize sumSET regi,SET reg2, MAX SIZESET reg), glistProcessArray:initialize loop counterinitialize array pointerLOAD reg4, [reg]regi, regreg), 4ADDADOLOOP ProcessArrayfetch current List elementpodd current List elementmove array pointer to next elementpouto-decrement reg2, jump to more if reg20If the initialization code has already executed (i.e. the SET instructions have already finished execution) how many array elements can be processed in4.2 milliseconds (ms)? Round your answer to the nearest integer. Recall that 1 ms -0.001 seconds. Also assume that there are no physical memorylimitations, implying that the array can be as large as desired.

Name: Suppose you have a RISC machine with a 2 GHz clock (e, the clock tick
Uploaded: 2024-03-20T06:51:23.000Z
Channel: Bartleby
Description: 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 instructioncache, a data cache, an operand fetch unit, and an operand store unit. The instruction set includes simpl

Answered: Image /qna-images/answer/ba22180f-c6c1-4788-bf7d-8cc6b216e1f6.jpg

Engineering

Computer Science

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. ined: 2 clock cycles LOAD reg, ne ; 3 clock cycles ADD reg, reg: 2 clock cycles ADD reg. inned; 1 clock cycles LOOP Laban; 2 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. initialize sum initialize Loop counter initiallae arrey pointer SET rega, SET reg2, MAX SIZE SET reg), glist Processarray: LOAD reg4, [reg3] ADD regi, reg 300 reg3, 4 LOOP ProcessArray fetch current List element 2 current List element nove array pointer to next element auto-decrement reg2, jump to more if reg2 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 (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. ined: 2 clock cycles LOAD reg, ne ; 3 clock cycles ADD reg, reg: 2 clock cycles ADD reg. inned; 1 clock cycles LOOP Laban; 2 clock cycles Assume that the following code fragment is used to sum the element of a numeric array. initialize sum initialize Loop counter initiallae arrey pointer SET rega, SET reg2, MAX SIZE SET reg), glist Processarray: LOAD reg4, [reg3] ADD regi, reg 300 reg3, 4 LOOP ProcessArray fetch current List element 2 current List element nove array pointer to next element auto-decrement reg2, jump to more if reg2 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.

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

See similar textbooks

Similar questions

A general register, a single accumulator, or a stack are the three potential configurations that might be chosen for the central processing unit (CPU) of a computer. The stack is the most common of these three options. Each choice comes with its own individual combination of benefits and drawbacks. It is up to you to provide a response, and the response that you provide may be accurate or it may be erroneous.
Computer science Computer architecture question No. 9 Quick response!
computer has RAM of size 32 GB, its instruction set has 64 instructions and there are 64 registers in the CPU. What is the format and size of each of the following instructions? Move R1, R2 Add R1, R2, R3 Move R2, z
Imagine we have a small computer which contains a simplified version of a CPU and RAM. The CPU can execute a single program that is stored in the RAM, and while running the program it can access 3 memory locations: its internal register AL, and two RAM locations that we'll call address 1 and address 2. Since this is a simplified computer it is able to skip some of the steps to access memory that are in our textbook, but accessing RAM still takes longer than accessing AL. The only values this computer is capable of storing in memory are unsigned bytes (8 bit binary numbers), and when it starts running a program all 3 of its memory locations initially contain the value 00000000. Here is a list of all of the instructions our imaginary computer can perform: Write [number] to AL This instruction takes the operand [number], which must be an 8-bit binary number, and puts it into AL. This overwrites whatever was in AL previously. It takes 3 cycles to complete: 1 cycle each to fetch, decode,…
A computer with a 32-bit word uses an instruction format that includes direct and indirect addressing of 8 megabytes and one of 16 registers. The highest order bits are used for the opcode, followed by the bits indicating the register, followed by the indirect/direct bit, followed by the bits indicating the memory address. Draw the instruction word's format, showing how many bits are used for all four fields (Make sure to show here how many bits for each and the order in which they appear. You can submit a drawing of the word's format separately
Given the following memory addresses and opcodes to be executed, if the current value of the Instruction Register (IR) is EBOA, what is the value of the Instruction Pointer Register (RIP) after the instruction in IR is executed? 00000000 EBOA 00000002 B805000000 00000007 BF01000000 0000000C BAODO00000 00000002 00000007 0000000A 0000000C
SP=1239H, SS=9876H, the physical address is OAAAFH O AAAFOH O 1всобн о O H66666 The instruction JMP BX is a * direct jump True O False O
the subject is microprocessor and please don't tell me that this is too complicated for you guys
A computer with a 32-bit 3.5 gigahertz scalar non- pipelined CPU needs to invert the colors of a 150 KB bitmap image file located in the RAM. To do this, each bit of the image must be complemented (Os are converted to 1s and vice-versa). Assume every instruction undergoes the following stages and each stage uses one CPU clock cycle: • Fetch • Decode • Read from memory • Execute • Write to memory Instructions: For this assignment, you must calculate how much time the computer will need to invert the image with a single-core and a dual core CPU. Show and explain your calculations and assumptions in a short paper and answer the following questions: • Will there be any parallel slowdown? Why or why not? Length: 2-3 page explanatory paper
Part 2: Status Flags There are more registers inside of the CPU that we don't have direct access to. One of these is the EFLAGS register. This register holds the values of the flags used in the CPU's operation. Flags are just single bit values that represent the state of the processor - usually 1 means a setting is on or true, and 0 means it is off or false. If a flag has the value 1, we say the flag is set. If it has the value 0, we say it is clear. "Setting" a flag means setting it's value to 1, and "clearing" a flag means setting its value to 0. The status flags are flags that show the outcomes of certain operations. These can be used to check the state of the computations and react accordingly. For example, the carry flag is set if the result of an unsigned addition is too large to fit into the same space as the numbers used during the addition. Look at the following addition operation: 11111111 + 00000001 = 100000000 Note that the result of the addition is 9 bits long, even…
Microprocessors
please answer the following question (part a and b) and explain your answer