dont copy the solutiondirectly downvote 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 operandstore unit. The instruction set includes simple instructions with the following timings:SET reg, immed ; 3 clock cyclesLOAD reg, mem ; 4 clock cyclesADD reg, reg ; 3 clock cyclesADD reg, immed ; 2 clock cyclesLOOP _LabelName ; 8 clock cyclesAssume that the following code fragment is used to sum the element of a numeric array.SET reg1, 0SET reg2, MAX_SIZE ;initialize loop counterSET reg3, @list ;initialize array pointerProcessArray:LOAD reg4, [reg3] ;fetch current list elementADD reg1, reg4ADD reg3, 4LOOP _ProcessArray ;auto-decrement reg2, jump to more if reg2 # 0If 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 nearestinteger. 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

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 real0 •initialize sum

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 real0 •initialize sum

Systems Architecture

7th Edition

ISBN:9781305080195

Author:Stephen D. Burd

Publisher:Stephen D. Burd

Chapter5: Data Storage Technology

Section: Chapter Questions

Problem 2PE

See similar textbooks

Similar questions

_____ is a CPU design technique in which instruction execution is divided into multiple stages and different instructions can execute in different stages simultaneously.
Most Intel CPUs use the __________, in which each memory address is represented by two integers.
A(n) ________________ instruction always alters the instruction execution sequence. A(n) ______________ instruction alters the instruction execution sequence only if a specified Condition is true.
Suppose that a RISC machine uses five register windows.Q) How deep can the procedure calls go before registers must be saved in memory? (That is, what is the maximum number of “active” procedure calls that can be made before we need to save any registers in memory?
Consider a memory implemented for 8086 microprocessor Draw the memory block diagram. Determine the values for A0 , /BHE ,address lines(A1..A19) and data lines(D0.. D15) in order to access: A byte at odd address [01FF3H] A byte at even address [01FFCH] A word at even address [01FFEH] A word at odd address [01ABFH]
Interface an 80286 microprocessor with total memory size 128KB using RAM chip size of 16KB. Show the detail of your drawing.
Suppose you have a computer that does instruction processing in anatomic way, with a clock cycle of 7ns and one instruction executioncompleted every cycle.You now split the processing into the five stages of the RISC pipeline,and you get required processing times of• IF: 1ns• ID: 1.5ns• EX: 1ns• MEM: 2ns• WB: 1.5nsYou now have added 0.1ns of delay between each of these stages. What’s the clock cycle time of this 5-stage pipelined machine?
Suppose an instruction takes four cycles to execute in a nonpipelined CPU: one cycle to fetch the instruction, one cycle to decode the instruction, one cycle to perform the ALU operation, and one cycle to store the result. In a CPU with a four-stage pipeline, that instruction still takes four cycles to execute, so how can we say the pipeline speeds up the execution of the program?
The three alternative designs for a computer's central processing unit (CPU) are a general register, a single accumulator, or a stack. Each one has a unique set of benefits and drawbacks. It is up to you to respond, and the response you give might be right or it might be wrong.
Suppose we have a 32-bit RISC-V word containing the value 0x00A12423. We would like to know what RISC-V machine instruction this represents. Translate this instruction to assembly language. Use symbolic register names like t0 instead of absolute register numbers like x5.
Suppose a RISC machine uses overlapping register windows for passing parameters between procedures. The machine has 298 registers. Each register window has 32 registers, of which 10 are global variables and 10 are local variables.Q) By how much would the current window pointer (CWP) be incremented at each procedure call?
Suppose a byte-addressable computer using 4-way setassociative cache has 216 words of main memory (where each word is 32 bits) and a cache of 32 blocks, where each block is four words. Show the main memory address format for this machine. (Hint: Because this architecture is byte addressable, and the number of addresses is critical in determining the address format, you must convert everything to bytes.)