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. : 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 sun SET reg, SET reg2, MAX SIZE SET reg), glist ProcessArray initialize loop counter initialize array pointer LOAD regt, [reg] 200 regi, reg reg3, 4 ADD LOOP ProcessArray fetch current List element odd current List element ve 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. : 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 sun SET reg, SET reg2, MAX SIZE SET reg), glist ProcessArray initialize loop counter initialize array pointer LOAD regt, [reg] 200 regi, reg reg3, 4 ADD LOOP ProcessArray fetch current List element odd current List element ve 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.

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

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

Consider the following instruction format and the list of opcodes 0101 *Note that all memory contents and addresses are hexadecimal. 0110 0001 0010 0011 Opcode (15.12) 0100 Instruction format Opcode Address(11..0) A portion of the instruction set Load AC from memory Store AC to memory Instruction Add AC from memory - AC + memory Subtract memory from AC - AC - memory Multiply AC by memory - AC*memory Divide AC by memory- AC/memory
dont dont dont post copied one strict strict downvote
Bus d'adresse Ox0 A7 0 A6 0 AS Oxo 0 A4 0 A3 0 A2 0 A1 Lecture Bus de contrôle Écriture AO Bus de données Mémoire d'Instructions Adr Adr Ctr Ctr Ctr Ox Mémoire de données Clavier Écran CD 0 EN Data Data EN Data EN Data EN Write the instruction STR R2, [R3] in hexadecimal (using 2 bytes). АО A1 DO D1 D d u r D3 D2 09
Suppose that you are working with a CISC machine using a 1.6 GHz clock (i.e., the clock ticks 1.6 billion times per second). This particular computer uses MASM-like instructions with the following timings: ADD reg, mem ADD reg, immed LOOP _LabelName ; 8 clock cycles (i.e., the ADD micro-program has 8 instructions) ; 3 сlоck суcles 7 clock суcles 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 MOV MOV BX, 0 ЕСХ, МАХ_SIZE ESI, OFFSET list ;initialize array pointer ;initialize sum ;initialize LOOP counter _ProcessArray: ADD ADD LOOP ProcessArray ВХ, [ESI] ESI, 2 ;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 2.8 millisecond (ms)? Round your answer to the nearest integer. Note that 1 ms = 0.001 second.
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.
Assume you have a processor with a clock speed of 2.5 GHz and it takes 5 clock cycles to execute a single instruction. What is the maximum number of instructions that can be executed by the processor in 1 second?
Assembly language Please Write a pseudo code of a program that uses a loop to calculate at least the first 10 values of the arithmetic sequence: 1,4,7,11,14,… (You need to add 3 to the current element to get the next element) and then implement the program using assembly
Computer science Computer architecture question No. 9 Quick response!
How many times the instruction (MUL DX) is ?executed MOV CX, OFFFFH MOV DX, 0458H SSS: MOVAX, 0023H MUL DX INC CX JZ RRR JNCSSS RRR: HLT FFFFH times O FFFEH times () 1 time O 0 time O
Translate this flowchart into assembly language
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,…